Systems and methods for automatic generation of parallel data processing code

ABSTRACT

Various systems and methods to generate automatically a procedure operative to distributively process a plurality of data sets stored on a plurality of memory modules. Under the instruction of the automatically generated procedure, compute elements request data sets relevant to a particular task, such data sets are fetched from memory modules by data interfaces which provide such data sets to the requesting compute elements, and the compute elements then process the received data sets until the task is completed. Relevant data sets are fetched and processed asynchronously, which means that the relevant data sets need not be fetched and processed in any particular order.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application is related to and claims priority under 35 USC§120 to U.S. Provisional Application No. 62/089,453, filed on Dec. 9,2014, which is hereby incorporated by reference.

The present application is also related to and claims priority under 35USC §120 to U.S. Provisional Application No. 62/109,663, filed on Jan.30, 2015, which is hereby incorporated by reference.

The present application is also related to and claims priority under 35USC §120 to U.S. Provisional Application No. 62/121,523, filed on Feb.27, 2015, which is hereby incorporated by reference.

The present application is also related to and claims priority under 35USC §120 to U.S. Provisional Application No. 62/129,876, filed on Mar.8, 2015, which is hereby incorporated by reference.

The present application is also related to and claims priority under 35USC §120 to U.S. Provisional Application No. 62/141,904, filed on Apr.2, 2015, which is hereby incorporated by reference.

The present application is also related to and claims priority under 35USC §120 to U.S. Provisional Application No. 62/149,606, filed on Apr.19, 2015, which is hereby incorporated by reference.

BACKGROUND

In parallel computing, one of the keys to fast and effective processingis the ability of multiple compute elements to access and processmultiple data sets stored in multiple memory modules. Such accessing andprocessing must be performed in parallel, simultaneously, in order tomaximize the effective processing rate of the system. However, achievingsimultaneous performance would require complex programming of thevarious compute elements and data managing elements. Needed are systemsand methods to reduce the complexity of programming such systems.

SUMMARY

Described herein are systems and methods to generate automatically aprocedure operative to distributively process a plurality of data setsstored on a plurality of memory modules. In one particular form of suchembodiment, the system (800, FIG. 28A) includes a first databaseconfigured to store a code sequence describing an action to be performedby a target system on each of a plurality of data sets stored in ashared memory pool including a plurality of memory modules associatedrespectively with a plurality of data interfaces, all belonging to thetarget system, in which the action per each of the plurality of datasets includes: (i) fetching that data set from the shared memory pool inthe target system, and (ii) processing that data set after it has beenfetched. The system includes also a first compute element having accessto the first database, and configured to convert the code sequence intoa sequence of executable instructions, in which the sequence ofexecutable instructions, when executed simultaneously by each of aplurality of compute elements of the target system, results in adistributive fetching-and-processing procedure. For each of theplurality of compute elements of the target system, the procedure isoperative to send a plurality of data requests to at least some of theplurality of data interfaces in which each of the data requests is sentto one of the plurality of data interfaces, to receive from the datainterface receiving the data request a reply including one of the datasets stored in the particular memory module associated with the datainterface, and to process the data sets received. Further, the sending,receiving, and processing are done by each of the plurality of computeelements until a first condition is met.

One embodiment is a system (800′, FIG. 28B) configured to generate andexecute a procedure operative to distributively process a plurality ofdata sets stored on a plurality of memory modules. In one particularform of such embodiment, there is a target system including a sharedmemory pool with a plurality of memory modules associated respectivelywith a plurality of data interfaces, and a plurality of computeelements. The system includes also a first database configured to storea code sequence describing an action to be performed by the targetsystem on each of a plurality of data sets stored in the shared memorypool, in which the action for each of the plurality of data setscomprises: (i) fetching the data set from the shared memory pool, and(ii) processing the data set fetched. The system includes also a firstcompute element having access to the first database and configured toconvert the code sequence into a sequence of executable instructions.Further, the plurality of compute elements is configured to executesimultaneously the sequence of executable instructions, resulting in adistributive fetching-and-processing procedure. Said procedure isoperative, per each of the plurality of compute elements, to send aplurality of data requests to at least some of the plurality of datainterfaces in which each of the data requests is sent to one of theplurality of data interfaces, to receive from the data interfacereceiving the data request a reply including a specific one of the datasets stored in the memory module associated with the data interface, andto process the data sets received. Further, the sending, receiving, andprocessing are done by each of the plurality of compute elements until afirst condition is met.

One embodiment is a method (FIG. 29) for generating automatically aprocedure operative to distributively process a plurality of data setsstored on a plurality of memory modules. In one particular form of suchembodiment, a first compute element receives a code sequence describingan action to be performed by a target system on each of a plurality ofdata sets stored in a shared memory pool including a plurality of memorymodules associated respectively with a plurality of data interfaces, andin which the action per each of the plurality of data sets includes (i)fetching the data set from the shared memory pool in the target system,and (ii) processing the data set fetched. Further, the first computeelement recognizes, by inspecting the code sequence, that (i) theplurality of data sets are stored across the plurality of memory modulesassociated respectively with the plurality of data interfaces, that (ii)any one of the plurality of data sets can be processed before or afterany other of the plurality of data sets, and therefore that (iii) eachfetch for one of the data sets can be done by any one of the pluralityof compute elements in conjunction with the data interface associatedwith the memory module storing that data set, asynchronously with anyother of the fetches done by any other of the plurality of computeelements in conjunction with any one of the data interfaces. Further,the first compute element converts, according to the recognition, thecode sequence into a sequence of executable instructions in which thesequence of executable instructions, when executed simultaneously byeach of a plurality of compute elements of the target system, results ina distributive fetching-and-processing procedure. Such procedure isoperative, per each of the plurality of compute elements, to send aplurality of data requests to at least some of the plurality of datainterfaces in which each of the data requests is sent to one of theplurality of data interfaces. Further, each of the plurality of computeelements is operative to receive, as a response to each of the datarequests, from the data interface receiving the data request, a replyincluding a specific one of the data sets stored in the memory moduleassociated with the data interface. Further, each of the plurality ofcompute elements is operative to process the data sets it has received.Further, the sending, receiving, and processing are done by each of theplurality of compute elements until a first condition is met.

BRIEF DESCRIPTION OF THE DRAWINGS

The embodiments are herein described, by way of example only, withreference to the accompanying drawings. No attempt is made to showstructural details of the embodiments in more detail than is necessaryfor a fundamental understanding of the embodiments. In the drawings:

FIG. 1A illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium;

FIG. 1B illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet;

FIG. 1C illustrates one embodiment of a system configured to implement acache related memory transaction over a shared input-output medium;

FIG. 1D illustrates one embodiment of a system configured to implement ageneral communication transaction over a shared input-output medium;

FIG. 2A illustrates one embodiment of a system configured to transmitdata packets associated with both either a cache related memorytransaction or a general communication transactions;

FIG. 2B illustrates one embodiment of a system designed to temporarilystop and then resume the communication of data packets for generalcommunication transactions;

FIG. 3A illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is a PCIE computer expansion bus, and the mediumcontroller is a root complex;

FIG. 3B illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is an Ethernet connection, and the medium controlleris a MAC layer;

FIG. 3C illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is an InfiniBand interconnect;

FIG. 4 illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which the system is implemented ina single microchip. In some embodiments, the various elements presentedin FIG. 4 may be implemented in two or more microchips;

FIG. 5A illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which there is a fiber optic lineand electrical/optical interfaces;

FIG. 5B illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which there are two or more fiberoptic lines, and in which each fiber optic line has two or moreelectrical/optical interfaces;

FIG. 6A illustrates one embodiment of a method for stopping transmissionof a data packet associated with a general communication transaction,and starting transmission of a data packet associated with a cacheagent;

FIG. 6B illustrates one embodiment of a method for delaying transmissionof a data packet associated with a general communication transaction,and transmitting instead a data packet associated with a cache agent;

FIG. 7A illustrates one embodiment of a system configured to cacheautomatically an external memory element as a result of a random-accessread cycle;

FIG. 7B illustrates one embodiment of prolonged synchronousrandom-access read cycle;

FIG. 7C illustrates one embodiment of a system with a random accessmemory that is fetching at least one data element from an externalmemory element, serving it to a compute element, and writing it to therandom access memory;

FIG. 7D illustrates one embodiment of a DIMM system configured toimplement communication between an external memory element, a first RAM,and a first computer element;

FIG. 7E illustrates one embodiment of a system controller configured tofetch additional data elements from additional memory locations of anexternal memory, and write such data elements to RAM memory;

FIG. 7F illustrates one embodiment of a process by which a system thewriting of additional data elements to RAM memory occurs essentiallyconcurrently with additional synchronous random-access write cycles;

FIG. 8A illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules;

FIG. 8B illustrates one embodiment of system configured to fetch sets ofdata from a shared memory pool;

FIG. 8C illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a firstcompute element is placed on a first motherboard, a first DIMM module isconnected to the first motherboard via a first DIMM slot, and first datalink is comprised of a first optical fiber;

FIG. 8D illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a secondcompute element is placed on a second motherboard, a second DIMM moduleis connected to the second motherboard via a second DIMM slot, and asecond data link is comprised of a second optical fiber;

FIG. 8E illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which each ofthe memory modules and the shared memory pool resides in a differentserver;

FIG. 8F illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a firstmemory module includes a first RAM operative to cache sets of data, afirst interface is configured to communicate with a first computeelement, and a second interface is configured to transact with theshared memory pool;

FIG. 8G illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which sets ofdata are arranged in a page format;

FIG. 8H illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, wherein a memorymodule includes a first RAM comprising a first bank of RAM and a secondbank of RAM;

FIG. 8I illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, wherein a memorymodule includes a first RAM comprising a first bank of RAM and a secondbank of RAM;

FIG. 9 illustrates one embodiment of a system configured to propagatedata among a plurality of computer elements via a shared memory pool;

FIG. 10A illustrates one embodiment of a system configured to allow aplurality of compute elements concurrent access to a shared memory pool,including one configuration of a switching network;

FIG. 10B illustrates one embodiment of a system configured to allow aplurality of compute elements concurrent access to a shared memory pool,including one configuration of a switching network;

FIG. 10C illustrates one embodiment of a system configured to allow aplurality of compute elements concurrent access to a shared memory pool,including one configuration of a switching network and a plurality ofoptical fiber data interfaces;

FIG. 10D illustrates one embodiment of a system configured to allow aplurality of compute elements concurrent access to a shared memory pool,including one configuration of a switching network, and a secondplurality of servers housing a second plurality of memory modules;

FIG. 11A illustrates one embodiment of a system configured to use acompute element to process a plurality of values distributed over aplurality of servers using a plurality of keys;

FIG. 11B illustrates one embodiment of a system configured to requestand receive data values needed for data processing;

FIG. 11C illustrates one embodiment of a system configured to streamlinea process of retrieving a plurality of values from a plurality ofservers using a plurality of keys;

FIG. 11D illustrates one embodiment of a system configured to minimizeor at least reduce the duration of time periods between general tasksexecuted by a first compute element;

FIG. 11E illustrates one embodiment of a system configured to increasethe utilization rate of a first compute element;

FIG. 11F illustrates one embodiment of a system configured to achieve arelatively high computational duty-cycle by at least temporarilyblocking or redirecting the execution of certain processes;

FIG. 12 illustrates one embodiment of a method for mixing and timing,relatively efficiently, at least two key-value transactions inconjunction with a distributed key-value-store (KVS);

FIG. 13A illustrates one embodiment of a system configured to interleavehigh priority key-value transactions together with lower prioritytransactions over a shared input-output medium;

FIG. 13B illustrates one embodiment of a system configured to interleavehigh priority key-value transactions together with lower prioritytransactions over a shared input-output medium, in which both types oftransactions are packet-based transactions;

FIG. 13C illustrates one embodiment of part of a system configured tointerleave high priority key-value transactions together with lowerpriority transactions over a shared input-output medium, comprising anetwork-interface-card (NIC) including a medium-access-controller (MAC);

FIG. 14A illustrates one embodiment of a method for mixing high prioritykey-value transaction together with lower priority transactions over ashared input-output medium without adversely affecting performance;

FIG. 14B illustrates one embodiment of a method for mixing high prioritykey-value transactions together with lower priority transactions over ashared input-output medium without adversely affecting performance;

FIG. 14C illustrates one embodiment of a method for reducing latencyassociated with a key-value transaction involving a distributed datastore interconnected by a network;

FIG. 15A illustrates one embodiment of a system operative to controlrandom memory access in a shared memory pool;

FIG. 15B illustrates one embodiment of a sub-system with an accesscontroller that includes a secured configuration which may be updated bya reliable source;

FIG. 15C illustrates one alternative embodiment of a system operative tocontrol random memory access in a shared memory pool;

FIG. 16A illustrates one embodiment of a method for determiningauthorization to retrieve a value in a key-value store while preservinglow latency associated with random-access retrieval;

FIG. 16B illustrates one alternative embodiment of a method fordetermining authorization to retrieve a value in a key-value store whilepreserving low latency associated with random-access retrieval;

FIG. 17A illustrates one embodiment of a system operative todistributively process a plurality of data sets stored on a plurality ofmemory modules;

FIG. 17B illustrates one embodiment of a system in which a plurality ofcompute elements send data requests to a single data interface;

FIG. 17C illustrates one embodiment of a system in which the datainterface then accesses multiple data sets stored in a single memorymodule, and then sends each such data set to the correct computeelement;

FIG. 17D illustrates one embodiment of a system in which a singlecompute element sends a plurality of data requests to a plurality ofdata interfaces;

FIG. 17E illustrates one embodiment of a system in which a singlecompute element receives responses to data requests that the computeelement sent to a plurality of data interfaces, in which each datainterface fetches a response from an associated memory module and sendsthat response to the compute element;

FIG. 18 illustrates one embodiment of a method for storing and sendingdata sets in conjunction with a plurality of memory modules;

FIG. 19A illustrates one embodiment of a system operative to achieveload balancing among a plurality of compute elements accessing a sharedmemory pool;

FIG. 19B illustrates one embodiment of a system including multiplecompute elements and a first data interface, in which the system isoperative achieve load balancing by serving data sets to the computeelements proportional to the rate at which the compute elements requestdata sets for processing;

FIG. 20 illustrates one embodiment of a method for load balancing aplurality of compute elements accessing a shared memory pool;

FIG. 21A illustrates one embodiment of a system operative to achievedata resiliency in a shared memory pool;

FIG. 21B illustrates one embodiment of a sub-system with a computeelement making a data request to an erasure-encoding interface whichconverts the request to a plurality of secondary data requests and sendssuch secondary data requests to a plurality of data interfaces;

FIG. 21C illustrates one embodiment of a sub-system with the pluralityof data interfaces using random-access read cycles to extract datafragments stored in associated memory modules;

FIG. 21D illustrates one embodiment of a sub-system with the pluralityof data interfaces sending, as responses to the secondary data requests,data fragments to the erasure-coding interface which reconstructs theoriginal data set from the data fragments and sends such reconstructeddata set to the compute element as a response to that compute element'srequest for data;

FIG. 21E illustrates one embodiment of a sub-system with a computeelement streaming a data set to an erasure-coding interface whichconverts the data set into data fragments and streams such datafragments to multiple data interfaces, which then write each datafragment in real-time in the memory modules associated with the datainterfaces;

FIG. 22A illustrates one embodiment of a system operative tocommunicate, via a memory network, between compute elements and externaldestinations;

FIG. 22B illustrates one embodiment of a system operative tocommunicate, via a switching network, between compute elements andmemory modules storing data sets;

FIG. 23A illustrates one embodiment of a method for facilitating generalcommunication via a switching network currently transporting a pluralityof data elements associated with a plurality of memory transactions;

FIG. 23B illustrates an alternative embodiment of a method forfacilitating general communication via a switching network currentlytransporting a plurality of data elements associated with a plurality ofmemory transactions;

FIG. 24A illustrates one embodiment of a system configured to generateautomatically a procedure to effectively combine fetching and processingof data sets;

FIG. 24B illustrates one embodiment of a compute element operative tofetch and process data sets, including a depiction of the requests fordata sets and the reception of data sets;

FIG. 24C illustrates one embodiment of a system configured to generateautomatically a procedure to effectively combine fetching and processingof data sets, in which executable instructions are executed immediatelyupon their receipt by an executing compute element;

FIG. 25 illustrates one embodiment of a method for generating a sequenceof executable instructions operative to combine effectively fetching andprocessing of data sets;

FIG. 26 illustrates one embodiment of a system using a plurality oflinked lists for keeping track of changes to be made in data setscurrently stored in a flash memory;

FIG. 27 illustrates one embodiment of a method for keeping track ofchanges to be made in data sets currently stored in a flash memory;

FIG. 28A illustrates one embodiment of a system configured to generateautomatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules of atarget system, in which the target system is not part of the configuredsystem;

FIG. 28B illustrates one embodiment of a system configured to generateautomatically a procedure operate to distributively process a pluralityof data sets stored on a plurality of memory modules of a target system,in which the target system is part of the configured system;

FIG. 29 illustrates one embodiment of a method for generatingautomatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules;

FIG. 30A illustrates one embodiment of a system configured to generateautomatically a procedure operative to divide a processing task betweentwo or more compute elements, in which there are at least twosub-systems, each including at least one compute element;

FIG. 30B illustrates one embodiment of a system configured to generateand execute a procedure operative to divide a processing task betweentwo or more compute elements, in which all compute elements are part ofthe same system;

FIG. 31 illustrates one embodiment of a method for generatingautomatically a procedure operative to divide a processing task betweentwo or more compute elements;

FIG. 32 illustrates one embodiment of a system configured to performefficiently a first processing task in conjunction with a plurality ofdata sets; and

FIG. 33 illustrates one embodiment of a method for performingefficiently and distributively a first processing task in conjunctionwith each of a plurality of data sets.

DETAILED DESCRIPTION

In this description, “cache related memory transaction” or a “directcache related memory transaction” is a transfer of one or more datapackets to or from a cache memory. A “latency-critical cachetransaction” is a cache transaction in which delay of a data packet toor from the cache memory is likely to delay execution of the task beingimplemented by the system.

In this description, “general communication transaction” is a transferof one or more data packets from one part of a communication system toanother part, where neither part is a cache memory.

In this description, a “communication transaction” is a transfer of oneor more data packets from one part of a communication system to anotherpart. This term includes both “cache related memory transaction” and“general communication transaction”.

In this description, a “shared input-output medium” is part of a systemthat receives or sends both a data packet in a cache related memorytransaction and a data packet in a general communication transaction.Non-limiting examples of “shared input-output medium” include a PCIEcomputer extension bus, an Ethernet connection, and an InfiniBandinterconnect.

In this description, an “external I/O element” is a structural elementoutside of the system. Non-limiting examples include a hard disc, agraphic card, and a network adapter.

In this description, an “external memory element” is a structure outsidethe system that holds data which may be accessed by the system in orderto complete a cache related memory transaction or other memorytransactions.

In this description, “cache-coherency” is the outcome of a process bywhich consistency is achieved between a cache memory and one or moreadditional cache memory locations inside or external to the system.Generally, data will be copied from one source to the other, such thatcoherency is achieved and maintained. There may be a separate protocol,called a “cache-coherency protocol”, in order to implementcache-coherency.

In this description, an “electro-optical interface” is a structure thatallows conversion of an electrical signal into an optical signal, orvice versa.

In this description, a “prolonged synchronous random-access read cycle”is a synchronous RAM read cycle that has been lengthened in time topermit access from an external memory element.

In this description, “shared memory pool” is a plurality of memorymodules that are accessible to at least two separate data consumers inorder to facilitate memory disaggregation in a system.

In this description, “simultaneously” means “essentiallysimultaneously”. In other words, two or more operations occur within asingle time period. This does not mean necessarily that each operationconsumes the same amount of time—that is one possibility, but in otherembodiments simultaneously occurring operations consume differentamounts of time. This also does not mean necessarily that the twooperations are occurring continuously—that is one possibility, but inother embodiments an operation may occur in discrete steps within thesingle time period. In this description, “simultaneity” is the action oftwo or more operations occurring “simultaneously”.

In this description, “efficiently” is a characterization of an operationwhose intention and/or effect is to increase the utilization rate of oneor more structural elements of a system. Hence, “to efficiently use acompute element” is an operation that is structured and timed such thatthe utilization rate of the compute element is increased. Hence,“efficiently mixing and timing at least two key-value transactions” isan operation by which two or more needed data values are identified,requested, received, and processed, in such a manner that theutilization rate of the compute element in increased.

In this description, “utilization rate” is the percentage of time that astructural element of a system is engaged in useful activity. Theopposite of “utilization rate” is “idle rate”.

In this description, a “needed data value” is a data element that isheld by a server and needed by a compute element to complete a computeoperation being conducted by the compute element. The phrase “datavalue” and the word “value” are the same as “needed data value”, sinceit is understand that in all cases a “value” is a “data value” and inall cases a “data value” is needed by a compute element for the purposejust described.

In this description, “derive” is the operation by which a computeelement determines that a needed data value is held by one or morespecific servers. The phrase “derive” sometimes appears as “identify”,since the objective and end of this operation is to identify thespecific server or servers holding the needed data value. If a neededdata value is held in two or more servers, in some embodiments thecompute element will identify the specific server that will be asked tosend the needed data value.

In this description, “request” is the operation by which a computeelement asks to receive a needed set of data or data value from a serverholding that set of data or data value. The request may be sent from thecompute element to either a NIC and then to a switched network ordirectly to the switched network. The request is then sent from theswitched network to the server holding the needed data value. Therequest may be sent over a data bus.

In this description, “propagation of a request” for a needed data valueis the period of time that passes from the moment a compute elementfirst sends a request to the moment that that the request is received bya server holding the needed data value.

In this description, “get” is the operation by which a compute elementreceives a needed data value from a server. The needed data value issent from the server to a switching network, optionally to a NIC andthen optionally to a DMA controller or directly to the DMA controller,and from the DMA controller or the NIC or the switching network eitherdirectly to the compute element or to a cache memory from which thecompute element will receive the needed data value.

In this description, “process” is the operation by which a computeelement performs computations on a needed data value that it hasreceived. In other words, the compute element fulfills the need byperforming computations on the needed data element. If, for example, thesocial security number of a person is required, the “needed data value”may be the person's name and number, and the “process” may by theoperation by which the compute element strips off the number and thenapplies it in another computation or operation.

In this description, “compute element” is that part of the system whichperforms traditional computational operations. In this description, itmay be the part of the system that performs the derive, request, andprocess operations. In some embodiments, the compute element alsoreceives the needed data value from a server, via a switching network, aDMA, and optionally a NIC. In other embodiments, the requested datavalue is not received directly by the compute element, but is receivedrather by the cache memory, in which case the compute element obtainsthe needed value from the cache memory. A compute element may or may notbe part of a CPU that includes multiple compute elements.

In this description, “executing the request” is the operation duringwhich a server that has received a request for a needed data valueidentifies the location of the needed data value and prepares to sendthe needed data value to a switching network.

In this description, “key-value transaction” is the set of all theoperations in which a location of a needed data value is “derived” froma key, the data value is “requested” optionally with the key sent by acompute element through a communication network to a server holding thedata value, the request received by the server, “executed” by theserver, the data value sent by the server through the communicationnetwork, “gotten” by the compute element, and “processed” by the computeelement.

In this description, “latency-critical” means that a delay of processinga certain request for a value may cause a delay in system operation,thereby introducing an inefficiency into the system and degrading systemperformance. In some embodiments, the period of time for a“latency-critical” operation is predefined, which means that exceedingthat predefined time will or at least may degrade system performance,whereas completing the operation within that period of time will notdegrade system performance. In other embodiments, the time period thatis “latency-critical” is predefined, but is also flexible depending oncircumstances at the particular moment of performing thelatency-critical operation.

In this description, “determining” whether a compute element isauthorized to access a particular data set in a shared memory pool isthe process that determines whether a particular compute element in asystem has been authorized by some reliable source to access aparticular data set that is stored in a shared memory pool.

In this description, “accessing” a data set encompasses any or all ofentering an original value in a data set, requesting to receive anexisting data set, receiving an existing data set, and modifying one ormore values in an existing data set.

In this description, “preventing” delivery of a data set to a computeelement is the process by which an access controller or other part of asystem prevents such data set from being delivered to the computeelement, even though specifically requested by the compute element. Insome cases, denial of access is total, such that the compute element maynot access any part of the data set. In some cases, denial access ispartial, such that the compute element may access part but not all of adata set. In some cases, denial is conditional, such that the computeelement may not access the data set in its current form, but the systemmay modify the data set such that the compute element may access themodified data set. The prevention of delivery may be achieved usingvarious techniques, such as blocking of communication, interfering withelectronic processes, interfering with software processes, alteringaddresses, altering data, or any other way resulting in such prevention.

In this description, “data set” is a data structure that a computeelement might access in order for the compute element to process acertain function. A data set may be a single data item, or may bemultiple data items of any number or length.

In this description, a “server” may be a computer of any kind, amotherboard (MB), or any other holder of structures for either or bothof data memory and data processing.

In this description, “random access memory” may include RAM, DRAM, flashmemory, or any other type of memory element that allows random access tothe memory element, or at least a random access read cycle inconjunction with the memory element. The term does not include any typeof storage element that must be accessed sequentially, such as asequentially-accessed hard disk drive (HDD) or a sequentially accessedoptical disc.

In this description, “data interface” is a unit or sub-system thatcontrols the flow of data between two or more parts of a system. A datainterface may alter the data flowing through it. A data interface mayhandle communication aspects related to the flow of data, such asnetworking. A data interface may access memory modules storing the data.A data interface may handle messages in conjunction with the two or moreparts of the system. A data interface may handle signaling aspectsrelated to controlling any of the parts of the system. Some possiblenon-limiting examples of a “data interface” include an ASIC, an FPGA, aCPU, a microcontroller, a communication controller, a memory buffer,glue logic, and combinations thereof.

In this description, “data corpus” is the entire amount of data includedin related data sets, which together make up a complete file or othercomplete unit of information that may be accessed and processed bymultiple compute elements. As one example, the data corpus may be a copyof all the pages in the Internet, and each data set would be a singlepage.

In this description, a “memory module” is a physical entity in a systemthat stores data and that may be accessed independently of any othermemory module in the system and in parallel to any other memory modulein the system. Possible examples include a DIMM card or other physicalentity that may be attached or removed from the system, or a memory chipthat is part of the system but that is not necessarily removed orre-attached at will.

In this description, “data resiliency” means the ability of a system toreconstruct a data set, even if the system does not have all of the datathat makes up that data set. Any number of problems may arise in thatrequire “data resiliency”, including, without limitation, (i) thedestruction of data, (ii) the corruption of data, (iii) the destructionof any part of the operating, application, or other software in thesystem, (iv) the corruption of any part of operating, application, orother software in the system, (v) the destruction of a compute element,erasure-coding interface, data interface, memory module, server, orother physical element of the system, and (vi) the malfunction, whethertemporary or permanent, of a compute element, erasure-coding interface,data interface, memory module, server, or other physical element of thesystem. In all such cases, the system is designed and functions toprovide “data resiliency” to overcome the problem, and thus providecorrect and whole data sets.

In this description, an “external destination” is a destination that isoutside a system, wherein such system may include a switching network,compute elements, and memory modules storing data sets. An externaldestination may be a data center, a computer, a server, or any othercomponent or group of components that are capable of receiving anelectronic communication message.

In this description, a “respective block” means the specific memoryblock within a flash memory that is associated with a particular linkedlist, such that aggregation of all the changes indicated in the linkedlist will result in execution of all such changes when the memory blockis rewritten.

FIG. 1A illustrates one embodiment of a system 100 configured to mixcache related memory transactions together with general communicationtransactions over a shared input-output medium 105. The system 100includes a number of computing elements, including a first computeelement 100-c 1 through N-th compute element 100-cn. The computeelements are in communicative contact with a cache memory 101, which isin communicative contact with a cache agent 101-ca that controlscommunication between the cache memory 101 and a medium controller105-mc. The medium controller 105-mc controls communication between thecache agent 101-ca and a shared input-output medium 105, which iscommunicative contact with an external memory elements 112 that isoutside the system 100.

FIG. 1B illustrates one embodiment of a system 100 configured to mixcache related memory transactions together with general communicationtransactions over a shared input-output medium 105, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet. Here two transactions are illustrated.One transaction 101-tran is a cache related memory transaction betweenthe cache memory 101 and the external memory element 112, via the cacheagent 101-ca, the medium controller 105-mc, and the shared input-outputmedium 105. Transaction 101-tran can go to the cache memory 101, or tothe external memory element 112, or in both directions, and may includea cache-coherency transaction. In some embodiments, there is anadditional path 101-init between the cache agent 101-ca and the cachememory 101, in which the cache agent initiates transaction 101-tran. Thesecond transaction 106-tran, is a general communication transactionbetween a part of the system other than the cache memory 101, and someexternal element other than the external memory element 112, such as anexternal I/O elements 119 in FIG. 1D. This transaction 106-tran alsogoes through the shared input-output medium 105 and the mediumcontroller 105-mc, but then continues to another part of the systemrather than to the cache agent 101-ca.

FIG. 1C illustrates one embodiment of a system configured to implement acache related memory transaction over a shared input-output medium 105.The DMA controller 105-dma performs copy operations 101-copy from thecache memory 101 into the media controller 105-mc, and from the mediacontroller to the external memory element 112, or vice-versa.

FIG. 1D illustrates one embodiment of a system configured to implement ageneral communication transaction over a shared input-output medium 105.The DMA controller 105-dma performs copy operations 106-copy from anon-cache related source (not shown) into the media controller 105-mc,and from the media controller to the external I/O element 119, orvice-versa.

FIG. 2A illustrates one embodiment of a system configured to transmitdata packets associated with both either a cache related memorytransaction or a general communication transactions. It illustrates thattransactions occur in the form of data packets. The cache related memorytransaction 101-tran includes a number of data packets, P1, P2, throughPn, that will pass through the medium controller 105-mc. Again, the datapackets may flow in either or both ways, since data packets may transmitto or from the cache memory. The cache related memory transaction101-tran is a packetized transaction 101-tran-P. In the same, or atleast an overlapping time period, there is a general communicationtransaction 106-tran which includes a number of data packets P1, P2,through Pn, which are all part of the general communication transaction106-tran that is a packetized transaction 106-tran-P. This packetizedtransaction 106-tran-P also passes through the medium controller 105-mc,and may pass in both directions.

FIG. 2B illustrates one embodiment of a system designed to temporarilystop and then resume the communication of data packets for generalcommunication transactions. Here, a general packetized communicationtransaction 106-tran-P includes a first packet 106-tran-first-P. Aftertransaction 106-tran-P has begun, but while first packet106-tran-first-P is still in process, a packetized cache related memorytransaction 101-tran-P begins with a second packet 101-trans-second-P.When the system understands that there are two transactions occurring atthe same time, one of which is cache related memory 101-tran-P and theother 106-tran-P not, the system will cause the general communicationtransaction to stop 106-stop transmission of the particular data packet106-tran-first-P. After all of the data packets of 101-tran-P havepassed the system, the system will then allow the general communicationtransaction to resume 106-resume and complete the transmission of packet106-tran-first-P. In some embodiments, the system will allow completionof a data packet from 106-tran-P when such packet is inmid-transmission, but in some embodiments the system will stop the datapacket flow of 106-tran-P even in mid-packet, and will then repeat thatpacket when the transaction is resumed 106-resume In some of the variousembodiments, the particular element that understands there are twotransactions at the same time, and that stops and then resumes106-tran-P, is the medium controller element 105-mc or some othercontroller such as those illustrated and explained in FIGS. 3A, 3B, and3C, below.

FIG. 3A illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is a PCIE computer expansion bus 105-pcie, and themedium controller is a root complex 105-root. In FIG. 3A, the specificshared input-output medium 105 is a PCIE computer expansion bus105-pcie, and the specific medium controller 105-mc is a root complex105-root. Both the cache related memory transaction 101-tran and thegeneral communication transaction 106-tran pass through both 105-pcieand 105-root.

FIG. 3B illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is an Ethernet connection 105-eth, and the mediumcontroller is a MAC layer 105-mac. In FIG. 3B, the specific sharedinput-output medium 105 is an Ethernet connection 105-eth, and thespecific medium controller 105-mc is a MAC layer 105-mac. Both the cacherelated memory transaction 101-tran and the general communicationtransaction 106-tran pass through both 105-eth and 105-mac.

FIG. 3C illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium, in which such sharedinput-output medium is an InfiniBand interconnect 105-inf.

FIG. 4 illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium 105, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which the system is implemented ina single microchip. In some embodiments, the various elements presentedin FIG. 4 may be implemented in two or more microchips. In FIG. 4,various elements of the system previously described are implemented in asingle microchip 100-cpu. Such elements include various processingelements, 100 c-1 through 100-cn, a cache memory 101, a cache agent101-ca, a medium controller 105-mc, and a shared input-output medium105. In FIG. 4, there is a cache related memory transaction 101-tranbetween cache memory 101 and an external memory element 112. There isfurther a general communication transaction 106-tran between an externalI/O element 119, such as a hard disc, a graphic card, or a networkadapter, and a structure other than the cache memory 101. In theparticular embodiment illustrated in FIG. 4, the non-cache structure isa DRAM 110-dram, and the communication path between 110-dram and 119includes a memory controller 110 as shown. The DRAM 110-dram may be partof a computer, and the entire microchip 100-cpu may itself be part ofthat computer. In other embodiments, the structure other than cachememory 101 may also be on chip 100-cpu but not cache memory 101, or thestructure may be another component external to the chip 100-cpu otherthan DRAM 100-dram.

FIG. 5A illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium 105, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which there is a fiber optic line107-fiber-ab and electrical/optical interfaces 107-a and 107-b. In FIG.5A, there is a cache related memory transaction 101-tran between cachememory 101 (not shown in FIG. 5A) and external memory element 112, inwhich data packets may move in both directions to and from the externalI/O memory element 112, and electrical-optical interface 107 b, a sharedinput-output medium 105 which as illustrated here is a fiber optic line107-fiber-ab and another electrical-optical interface 107-a, and amedium controller 105-mc. The connection from 112 to 107-b iselectrical, the electrical signal is converted to optical signal at107-b, and the signal is then reconverted back to an electrical signalat 107-a. FIG. 5A includes also a general communication transaction106-tran between an external I/O element 119 and either a part of thesystem that is either not the cache memory 101 (not shown in FIG. 5A) orthat is outside of the system, such as 110-dram (not shown in FIG. 5A).The signal conversions for 106-tran are the same as for 101-tran. In theevent that 101-tran and 106-tran occur simultaneously or at least withan overlap in time, the medium control 101-mc will either stop andresume, or at least delay, the 106-tran data packets to give priority tothe 101-tran data packets.

FIG. 5B illustrates one embodiment of a system configured to mix cacherelated memory transactions together with general communicationtransactions over a shared input-output medium 105, in which there is aconflict between a cache related memory I/O data packet and a generalcommunication I/O data packet, and in which there are two or more fiberoptic lines 107-fiber-cd and 107-fiber-ef, and in which each fiber opticline has two or more electrical/optical interfaces, 107-c and 107-d for107-fiber-cd, and 107-e and 107-f for 107-fiber-ef. FIG. 5B presents onealternative structure to the structure shown in FIG. 5A. In FIG. 5B, theelectrical-optical interfaces and the fiber optic line are not shared.Rather, cache related memory transaction 101-tran between externalmemory element 112 and cache memory 101 (not shown in FIG. 5B) occursover e/o interface 107-d not shared with 106-tran, fiber optic line107-fiber-cd not shared with 106-tran, e/o interface 107-c not sharedwith 106-tran, and medium controller 105-mc which is shared with106-tran, and which senses multiple transactions and gives priority to101-tran data packets. Also, general communication transaction 106-tranbetween external I/O element 119 and a non-cache element (not shown inFIG. 5B) occurs over e/o interface 107-f not shared with 101-tran, fiberoptic line 107-fiber-ef not shared with 101-tran, e/o interface 107-enot shared with 101-tran, and medium controller 105-mc which is sharedwith 101-tran, senses multiple transactions, and give priority to101-tran data packets.

One embodiment is a system 100 configured to mix cache related memorytransactions together with general communication transactions over ashared input-output medium. Various embodiments include a sharedinput-output medium 105 associated with a medium controller 105-mc, acache agent 101-ca, and a first cache memory 101 associated with saidcache agent 101-ca. Further, in some embodiments, the cache agent 101-cais configured to initiate 101-init direct cache related memorytransactions 101-tran between the first cache memory 101 and an externalmemory element 112, via said shared input-output medium 105. Further, insome embodiments the medium controller 105-mc is configured to blockgeneral communication transactions 106-tran via said shared input-outputmedium 105 during the direct cache related memory transactions 101-tran,thereby achieving the mix of transactions without delaying the directcache related memory transactions 101-tran.

In one alternative embodiment to the system just described, the mediumcontroller 105-mc includes a direct-memory-access (DMA) controller105-dma configured to perform the direct cache related memorytransactions 101-tran by executing a direct copy operation 101-copybetween the first cache memory 101 and the external memory element 112via the shared input-output medium 105.

In one possible variation of the alternative embodiment just described,the direct-memory-access (DMA) controller 105-dma is further configuredto perform the general communication transactions 106-tran by executinganother direct copy operation 106-copy in conjunction with an externalinput-output element 119 via the shared input-output medium 105.

In a second alternative embodiment to the system of mixing cache relatedmemory transactions together with general communication transactions,further the direct cache related memory transactions 101-tran arelatency-critical cache transactions. Further, the medium controller105-mc is configured to interrupt any of the general communicationtransactions 106-tran and immediately commence the direct cache relatedmemory transactions 101-tran, thereby facilitating the latencycriticality.

In one possible variation of the second alternative embodiment justdescribed, further both said direct cache related memory transactions101-tran and general communication transactions 106-tran arepacket-based transactions 101-tran-P, and 106-tran-P is performed viathe medium controller 105-mc in conjunction with the shared input-outputmedium 105. Further, the medium controller 105-mc is configured to stop106-stop on-going communication of a first packet 106-tran-first-Pbelonging to the general communication transactions 106-tran via theshared input-output medium 105, and substantially immediately commencecommunication of a second packet 101-tran-second-P belonging to thedirect cache related memory transactions 101-tran via the sharedinput-output medium 105 instead, thereby achieving the interruption atthe packet level.

In one possible configuration of the possible variation just described,further the medium controller 105-mc is configured to resume 106-resumecommunication of the first packet 106-tran-first-P after the secondpacket 101-tran-second-P has finished communicating, therebyfacilitating packet fragmentation.

In a third alternative embodiment to the system of mixing cache relatedmemory transactions together with general communication transactions,the shared input-output medium 105 is based on an interconnect elementselected from a group consisting of (i)peripheral-component-interconnect-express (PCIE) computer expansion bus105-pcie, (ii) Ethernet 105-eth, and (iii) InfiniBand 105-inf.

In one embodiment associated with the PCIE computer expansion bus105-pcie, the medium controller 105-mc may be implemented as part of aroot-complex 105-root associated with said PCIE computer expansion bus105-pcie.

In one embodiment associated with the Ethernet 105-eth, the mediumcontroller 105-mc may be implemented as part of amedia-access-controller (MAC) 105-mac associated with said Ethernet105-eth.

In a fourth alternative embodiment to the system of mixing cache relatedmemory transactions together with general communication transactions,further the direct cache related memory transactions 101-tran andgeneral communication transactions 106-tran are packet-basedtransactions 101-tran-P, and 106-tran-P is performed via the mediumcontroller 105-mc in conjunction with said the shared input-outputmedium 105. Further, the medium controller 105-mc is configured to denyaccess to the shared input-output medium 105 from a first packet106-tran-first-P belonging to the general communication transactions106-tran, and instead to grant access to the shared input-output medium105 to a second packet 101-tran-second-P belonging to the direct cacherelated memory transactions 101-tran, thereby giving higher priority tothe direct cache related memory transactions 101-tran over the generalcommunication transactions 106-tran.

In a fifth alternative embodiment to the system of mixing cache relatedmemory transactions together with general communication transactions,further there is at least a first compute element 100-c 1 associatedwith the cache memory 101, and there is a memory controller 110associated with an external dynamic-random-access-memory (DRAM)110-dram. Further, the system 100 is integrated inside acentral-processing-unit (CPU) integrated-circuit 100-cpu, and at leastsome of the general communication transactions 106-tran are associatedwith the memory controller 110 and DRAM 110-dram.

In a sixth alternative embodiment to the system of mixing cache relatedmemory transactions together with general communication transactions,further the system achieves the mix without delaying the direct cacherelated memory transactions 101-tran, which allows the system 100 toexecute cache-coherency protocols in conjunction with the cache memory101 and the external memory element 112.

In a seventh alternative embodiment to the system of mixing cacherelated memory transactions together with general communicationtransactions, the shared input-output medium 105 includes anelectro-optical interface 107-a and an optical fiber 107-fiber-aboperative to transport the direct cache related memory transactions101-tran and the general communication transactions 106-tran.

In an eighth alternative embodiment to the system of mixing cacherelated memory transactions together with general communicationtransactions, further including a first 107-c and a second 107-delectro-optical interface, both of which are associated with a firstoptical fiber 107-fiber-cd, and are operative to transport the directcache related memory transactions 101-tran in conjunction with themedium controller 105 and the external memory element 112.

In a possible variation of the eighth alternative embodiment justdescribed, further including a third 107-e and a fourth 107-felectro-optical interface, both of which are associated with a secondoptical fiber 107-fiber-ef, and are operative to transport the generalcommunication transactions 106-tran in conjunction with the mediumcontroller 105 and an external input-output element 119.

FIG. 6A illustrates one embodiment of a method for mixing cache relatedmemory transactions 101-tran together with general communicationtransactions 106-tran over a shared input-output medium 105 withoutadversely affecting cache performance. In step 1011, a medium controller105-mc detects, in a medium controller 105-mc associated with a sharedinput-output medium 105, an indication from a cache agent 101-caassociated with a cache memory 101, that a second packet101-tran-second-P associated with a cache related memory transactions101-tran is pending. In step 1012, as a result of the indication, themedium controller 105-mc stops transmission of a first packet106-tran-first-P associated with a general communication transactions106-tran via the shared input-output medium 105. In step 1013, themedium controller 105-mc commences transmission of the second packet101-tran-second-P via said the input-output medium 105, therebypreserving cache performance in conjunction with the cache relatedmemory transactions 101-tran.

In a first alternative embodiment to the method just described, furtherthe cache performance is associated with a performance parameterselected from a group consisting of: (i) latency, and (ii) bandwidth.

In a second alternative embodiment to the method just described formixing cache related memory transactions together with generalcommunication transactions over a shared input-output medium withoutadversely affecting cache performance, further the general communicationtransactions 106-tran are packet-based transactions 106-tran-P performedvia the medium controller 105-mc in conjunction with the sharedinput-output medium 105. Also, the cache performance is associated withlatency and this latency is lower than a time required to transmit ashortest packet belonging to said packet-based transaction 106-tran-P.

FIG. 6B illustrates one embodiment of a method for mixing cache relatedmemory transactions together with general communication transactionsover a shared input-output medium without adversely affecting cacheperformance. In step 1021, a medium controller 105-mc associated with ashared input-output medium 105 detects an indication from a cache agent101-ca associated with a cache memory 101, that a second packet101-tran-second-P associated with a cache related memory transactions101-tran is pending. In step 1022, as a result of the indication, themedium controller 105-mc delays transmission of a first packet106-tran-first-P associated with a general communication transaction106-tran via the shared input-output medium 105. In step 1023, themedium controller 105-mc transmits instead the second packet101-tran-second-P via the shared input-output medium 105, therebypreserving cache performance in conjunction with the cache relatedmemory transactions 101-tran.

In a first alternative embodiment to the method just described, thecache performance is associated with a performance parameter selectedfrom a group consisting of: (i) latency, and (ii) bandwidth.

In a second alternative embodiment to the method just described formixing cache related memory transactions together with generalcommunication transactions over a shared input-output medium withoutadversely affecting cache performance, further the general communicationtransactions 106-tran are packet-based transactions 106-tran-P performedvia the medium controller 105-mc in conjunction with the sharedinput-output medium 105. Also, the cache performance is associated withlatency; and said latency is lower than a time required to transmit ashortest packet belonging to said packet-based transaction 106-tran-P.

FIG. 7A illustrates one embodiment of a system configured to cacheautomatically an external memory element as a result of a random-accessread cycle. A system 200 is configured to cache automatically anexternal memory element as a result of a random-access read cycle. Inone particular embodiment, the system includes a first random-accessmemory (RAM) 220-R1, a first interface 221-i 1 configured to connect thesystem 200 with a compute element 200-c 1 using synchronous randomaccess transactions 221-tr, and a second interface 221-i 2 configured toconnect 221-connect the system 200 with an external memory 212.

FIG. 7B illustrates one embodiment of prolonged synchronousrandom-access read cycle. The system 200 is configured to prolong221-tr-R-prolong a synchronous random-access read cycle 221-tr-R fromthe time period between T1 and T2 to the time period between T1 to T3,the prolongation being the period between T2 and T3.

FIG. 7C illustrates one embodiment of a system with a random accessmemory that is fetching at least one data element from an externalmemory element, serving it to a compute element, and writing it to therandom access memory. In one particular embodiment, the prolong221-tr-R-prolong (FIG. 7B) is initiated by the first computer element200-c 1 when the synchronous random-access read cycle 221-tr-R (FIG. 7B)is detected to be addressed to a first memory location 212-L1 of theexternal memory element 212 currently not cached by the firstrandom-access memory 220-R1 (FIG. 7A). The system 200 is furtherconfigured to fetch 212-L1-fetch, via the second interface 221-i 2 (FIG.7A), from the external memory element 212, at least one data element212-D1 associated with the first memory location 212-L1. The system isfurther configured to serve 212-D1-serve to the first compute element200-c 1, as part of the synchronous random-access read cycle 221-tr-R(FIG. 7B) prolonged, via the first interface 221-i 1 (FIG. 7A), the atleast one data element 212-D1 that was previously fetched, therebyconcluding successfully the synchronous random-access read cycle221-tr-R (FIG. 7B). The system is further configured to write212-D1-write the at least one data element 212-D1 to the firstrandom-access memory 220-R1, thereby caching automatically the firstmemory location 212-L1 for faster future access by the first computeelement 200-c 1.

FIG. 7D illustrates one embodiment of a DIMM system configured toimplement communication between an external memory element, a first RAM,and a first computer element. In one particular embodiment, the firstcompute element 200-c 1 is placed on a first motherboard 200-MB.Further, the system 200 is implemented on a first printed-circuit-board(PCB) having a form factor of a dual-in-line-memory-module (DIMM)200-DIMM, such that the system 200 is connected to the first motherboard200-MB like a dual-in-line-memory-module, and such that the firstcompute element 200-c 1 perceives the system 200 as essentially adual-in-line-memory-module. Further, the external memory element 212 isnot placed on said first motherboard 200-MB. Further, the secondinterface 221-i 2 (FIG. 7A) is an electrical-optical interface 221-i2-EO, connected to the external memory element 212 via an optical fiber207-fiber, together operative to facilitate said connection 221-connect.In the embodiment shown in FIG. 7D, first RAM 220-R1 and first interface221-i 1 are structured and function as described in FIG. 7A.

FIG. 7E illustrates one embodiment of a system controller configured tofetch additional data elements from additional memory locations of anexternal memory, and write such data elements to RAM memory. The system200 includes a system controller 200-cont that is configured to fetch212-L1-fetch-add additional data elements 212-Dn respectively fromadditional memory locations 212-Ln of the external memory element 212,wherein the additional memory locations 212-Ln are estimated, based atleast in part on the first memory location 212-L1 (FIG. 7C), to beaccessed in the future by the compute element 200-c 1 (FIG. 7A). Thesystem controller 200-cont is further configured to write 212-Dn-writethe additional data elements 212-Dn fetched to the first random-accessmemory 220-R1, thereby caching automatically the additional memorylocations 212-Ln for faster future access by the first compute element200-c 1 (FIG. 7A).

FIG. 7F illustrates one embodiment of a process by which a system 200(FIG. 7E) writing of additional data elements to RAM memory occursconcurrently with additional synchronous random-access write cycles. InFIG. 7E, the writing 212-Dn-write (FIG. 7E) of the additional dataelements 212-Dn (FIG. 7E) is operated essentially concurrently withadditional 221-tr-R-W-add synchronous random-access read cycles orsynchronous random-access write cycles made by said first computeelement 200-c 1 (FIG. 7A) in conjunction with the first interface 221-i1 (FIG. 7A) and the first random-access memory 220-R1 (FIG. 7E).

FIG. 8A illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules. In one particularembodiment, the system 300 includes first 300-c 1 and second 300-cncompute elements associated respectively with first 320-m 1 and second320-mn memory modules, each of said compute elements configured tocommunicate with its respective memory module using synchronous randomaccess transactions 321-tr. The system includes further a shared memorypool 312 connected with the first and second memory modules via first331-DL1 and second 331-DLn data links, respectively.

FIG. 8B illustrates one embodiment of system 300 (FIG. 8A) configured tofetch, by a first compute element, sets of data from a shared memorypool. FIG. 8B illustrates an additional embodiment of the system 300(FIG. 8A) illustrated in FIG. 8A, wherein the system 300 is (FIG. 8A)configured to use the first 320-m 1 and second 320-mn (FIG. 8A) memorymodules as a cache to the shared memory pool 312, such that sets of data312-D1 cached on the first 320-m 1 or second 320-mn (FIG. 8A) memorymodules are read 321-tr-R by the respective compute element 300-c 1 or300-cn (FIG. 8A) using the synchronous random access transactions 321-tr(FIG. 8A), and other sets of data 312-D2 that are not cached on saidfirst or second memory module are fetched 331-DL1-fetch from the sharedmemory pool 312 into the first 320-m 1 or second 320-mn (FIG. 8A) memorymodules upon demand from the respective compute elements 300-c 1 and300-cn (FIG. 8A).

FIG. 8C illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a firstcompute element is placed on a first motherboard, a first DIMM module isconnected to the first motherboard via a first DIMM slot, and first datalink is comprised of a first optical fiber. In one particular embodimentof the system 300 (FIG. 8A), the first 320-m 1 memory module is a firstdual-in-line-memory-module (DIMM) 300-DIMM-1. Further, the first computeelement 300-c 1 is placed on a first motherboard 300-MB-1, the firstdual-in-line-memory-module 300-DIMM-1 is connected to the firstmotherboard 300-MB-1 via a first dual-in-line-memory-module slot300-DIMM-1-slot, and the first data link 331-DL1 (FIG. 8A) includes afirst optical fiber 307-fiber-1 with a connection to a shared memorypool 312.

FIG. 8D illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a secondcompute element is placed on a second motherboard, a second DIMM moduleis connected to the second motherboard via a second DIMM slot, and asecond data link is comprised of a second optical fiber. FIG. 8Dillustrates one particular embodiment of the system 300 (FIG. 8A)illustrated in FIG. 8C, in which further the second 320-mn memory moduleis a second dual-in-line-memory-module 300-DIMM-n, the second computeelement 300-cn is placed on a second motherboard 300-MB-n, the seconddual-in-line-memory-module 300-DIMM-n is connected to the secondmotherboard 300-MB-n via a second dual-in-line-memory-module slot300-DIMM-n-slot, and the second data link 331-DLn (FIG. 8A) includes asecond optical fiber 307-fiber-n connected to a shared memory pool 312.

FIG. 8E illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which each ofthe memory modules and the shared memory pool resides in a differentserver. FIG. 8E illustrates one particular embodiment of the system 300(FIG. 8A) illustrated in FIG. 8D, in which further the first 300-MB-1and second 300-MB-n motherboards are placed in a first 300-S-1 and asecond 300-S-n server, respectively, and the shared memory pool 312 isplaced in a third server 300-server, in which there is a first data link331-DL1 between the first server 300-S1 and the third server 300-serverand in which there is a second data link 331-DLn between the secondserver 300-S-n and the third server 300-server. The structure presentedin FIG. 8E thereby facilitates distributed operation and memorydisaggregation.

FIG. 8F illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which a firstmemory module includes a first RAM operative to cache sets of data, afirst interface is configured to communicate with a first computeelement, and a second interface is configured to transact with theshared memory pool. In the system 300 (FIG. 8A) the first memory module320-m 1 includes a first random-access memory 320-R1 configured to cachethe sets of data 312-D1 (FIG. 8B), a first interface 321-i 1 configuredto communicate with the first compute element 300-c 1 using thesynchronous random access transactions 321-tr, and a second interface321-i 2 configured to transact with the external shared memory pool 312via the first data link 331-DL1.

FIG. 8G illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, in which sets ofdata are arranged in a page format. In this system 300 (FIG. 8A), thesets of data 312-D1 (FIG. 8B) and other sets of data 312-D2 (FIG. 8B)are arranged in a page format 312-P1, 312-Pn respectively. Also, thesystem 300 (FIG. 8A) is further configured to conclude that at leastsome of said other sets of data 312-D2 (FIG. 8B) are currently notcached on the first memory module 320-m 1, and consequently to issue, insaid first compute element 300-c 1, a page fault condition. The system300 (FIG. 8A) consequently fetches 331-DL1-fetch at least one page312-Pn from the shared memory pool 312, wherein the at least one page312-Pn contains the at least some of the other sets of data 312-D2 (FIG.8B). The system (FIG. 8A) further caches the at least one page 312-Pn inthe first memory module 320-m 1 for further use.

FIG. 8H illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, wherein a memorymodule includes a first RAM comprising a first bank of RAM and a secondbank of RAM. FIG. 8H and FIG. 8I together illustrate one embodiment of asystem 300 (FIG. 8A) that facilitates operation of the firstrandom-access memory 320-R1 similar to a dual-ported random-accessmemory. In FIG. 8H, the first memory module 320-m 1 includes a firstrandom-access memory 320-R1 which itself includes first 320-D1 andsecond 320-D2 banks of dynamic-random-access-memory (DRAM). Concurrencyis facilitated by the reading 321-tr-R (FIG. 8H) made from the firstbank 320-D1 (FIG. 8H) by the first compute element while at the sametime fetching 331-DL1-fetch (FIG. 8H) is done with the second bank320-D2 (FIG. 8H).

FIG. 8I illustrates one embodiment of a system configured to cache ashared memory pool using at least two memory modules, wherein a memorymodule includes a first RAM comprising a first bank of RAM and a secondbank of RAM. In FIG. 8I, the first memory module 320-m 1 includes afirst random-access memory 320-R1 which itself includes first 320-D1 andsecond 320-D2 banks of dynamic-random-access-memory (DRAM). Concurrencyis facilitated by the reading 321-tr-R (FIG. 8I) made from the secondbank 320-D2 (FIG. 8I) by the first compute element while at the sametime fetching 331-DL1-fetch (FIG. 8I) is done with the first bank 320-D1(FIG. 8I). The reading and fetching in FIG. 8I are implementedalternately with the reading and fetching in FIG. 8H, therebyfacilitating operation of the first random-access memory 320-R1 as adual-ported random-access memory.

FIG. 9 illustrates one embodiment of a system 400 configured topropagate data among a plurality of computer elements via a sharedmemory pool. In one particular embodiment, the system 400 includes aplurality of compute elements 400-c 1, 400-cn associated respectivelywith a plurality of memory modules 420-m 1, 420-mn, each compute elementconfigured to exchange 409-ex 1 data 412-D1 with the respective memorymodule using synchronous random access memory transactions 421-tr. Thesystem 400 includes further a shared memory pool 412 connected with theplurality of memory modules 420-m 1, 420-mn via a plurality of datalinks 431-DL1, 431-DLn respectively. In some embodiments, the system 400is configured to use the plurality of data links 431-DL1, 431-DLn tofurther exchange 409-ext the data 412-D1 between the plurality of memorymodules 420-m 1, 420-mn and the shared memory pool 412, such that atleast some of the data 412-D1 propagates from one 400-c 1 of theplurality of compute elements to the shared memory pool 412, and fromthe shared memory pool 412 to another one 400-cn of the plurality ofcompute elements.

FIG. 10A illustrates one embodiment of a system 500 configured to allowa plurality of compute elements concurrent access to a shared memorypool, including one configuration of a switching network 550. In oneparticular embodiment, the system 500 includes a first plurality of datainterfaces 529-1, 529-2, 529-n configured to connect respectively to aplurality of compute elements 500-c 1, 500-c 2, 500-cn with theswitching network 550. The system further includes a shared memory pool512, which itself includes a plurality of memory modules 540-m 1, 540-m2, 540-mn, connected to the switching network 550 via a second pluralityof data interfaces 523-1, 523-2, 523-k, respectively.

FIG. 10B illustrates one embodiment of a system configured to allow aplurality of compute elements concurrent access to a shared memory pool,including one configuration of a switching network. In one particularembodiment, the system 500 includes a switching network 550 operative totransport concurrently sets of data 512-D1, 512-D2, 512-Dn associatedwith a plurality of memory transactions 512-D1-TR, 512-D2-TR, 512-Dn-TR.The system further includes a first plurality of data interfaces 529-1,529-2, 529-n configured to connect respectively a plurality of computeelements 500-c 1, 500-c 2, 500-cn with the switching network 500. Thesystem further includes a shared memory pool 512, which itself includesa plurality of memory modules 540-m 1, 540-m 2, 540-mk, connected to theswitching network 550 via a second plurality of data interfaces 523-1,523-2, 523-k respectively, where the shared memory pool 512 isconfigured to store or serve the sets of data 512-D1, 512-D2, 512-Dnconcurrently by utilizing the plurality of memory modules concurrently,thereby facilitating a parallel memory access by the plurality ofcompute elements 500-c 1, 500-c 2, 500-cn in conjunction with theplurality of memory transactions 512-D1-TR, 512-D2-TR, 512-Dn-TR via theswitching network 550.

FIG. 10C illustrates one embodiment of a system 500 configured to allowa plurality of compute elements concurrent access to a shared memorypool, including one configuration of a switching network and a pluralityof optical fiber data interfaces. In one particular embodiment, thesystem 500 includes a plurality of servers 500-S-1, 500-S-2, 500-S-nhousing respectively said plurality of compute elements 500-c 1 (FIG.10B), 500-c 2 (FIG. 10B), 500-cn (FIG. 10B), and a memory-server500-S-memory housing said switching network 550 and a second pluralityof data interfaces 523-1, 523-2, 523-k, which are connected to,respectively, memory modules 540-m 1, 540-m 2, and 540-mk. The system500 further includes a first plurality of data interfaces 529-1 (FIG.10B), 529-2 (FIG. 10B), 529-n (FIG. 10B), which themselves include,respectively, a plurality of optical fibers 507-fiber-1, 507-fiber-2,507-fiber-n configured to transport a plurality of memory transactions512-D1-TR (FIG. 10B), 512-D2-TR (FIG. 10B), 512-Dn-TR (FIG. 10B) betweenthe plurality of servers 500-S-1, 500-S-2, 500-S-n and the memory-server500-S-memory.

FIG. 10D illustrates one embodiment of a system 500 configured to allowa plurality of compute elements concurrent access to a shared memorypool, including one configuration of a switching network 550, and asecond plurality of servers housing a second plurality of memorymodules. In one particular embodiment, the system 500 includes a secondplurality of servers 540-5-1, 540-S-2, 540-S-k housing respectively aplurality of memory modules 540-m 1 (FIG. 10C), 540-m 2 (FIG. 10C),540-mk (FIG. 10C). In some particular embodiments, a second plurality ofdata interfaces 523-1 (FIG. 10C), 523-2 (FIG. 10C), 523-k (FIG. 10C)comprises respectively a plurality of optical fibers 517-fiber-1,517-fiber-2, 517-fiber-k configured to transport a plurality of memorytransactions 512-D1-TR (FIG. 10B), 512-D2-TR (FIG. 10B), 512-Dn-TR (FIG.10B) between the second plurality of servers 540-S-1, 540-S-2, 540-S-kand the switching network 550.

One embodiment is a system 200 configured to cache automatically anexternal memory element 212 as a result of a random-access read cycle221-tr-R. In one embodiment, the system includes a first random-accessmemory (RAM) 220-R1, a first interface 221-i 1 configured to connect thesystem 200 with a first compute element 200-c 1 using synchronous randomaccess transactions 221-tr, and a second interface 221-i 2 configured toconnect 221-connect the system 200 with an external memory element 212.In some embodiments the system is configured to prolong 221-tr-prolong asynchronous random-access read cycle 221-tr-R initiated by the firstcompute element 200-c 1 in conjunction with the first interface 221-i 1when the synchronous random-access read cycle 221-tr-R is detected to beaddressed to a first memory location 221-L1 of the external memoryelement 212 currently not cached by the first random-access memory220-R-1, fetch 212-L1-fetch via the second interface 221-i 2 from theexternal memory element 212 at least one data element 212-D1 associatedwith the first memory location 212-L1, serve 212-D1-serve to the firstcompute element 200-c 1 as part of said synchronous random-access readcycle 221-tr-R prolonged via the first interface 221-i 1 the at leastone data element 212-D1 that was previously fetched thereby concludingsuccessfully said synchronous random-access read cycle 221-tr-R, andoptionally write 212-D1-write the at least one data element 212-D1 tothe first random-access memory 220-R1 thereby caching automatically thefirst memory location 212-L1 for faster future access by the firstcompute element 200-c 1.

In one alternative embodiment to the system 200 just described to cacheautomatically an external memory element 212, further the first computeelement is placed on a first motherboard 200-MB, the system 200 isimplemented on a first printed-circuit-board (PCB) having a form factorof a dual-in-line-memory-module (DIMM) 200-DIMM such that the system 200is connected to the first motherboard 200-MB like adual-in-line-memory-module and such that said first compute element200-c 1 perceives the system 200 as essentially adual-in-line-memory-module, the external memory element 212 is notplaced on the first motherboard 200-MB, and the second interface 221-i 2is an electrical-optical interface 221-i 2-EO connected to said externalmemory element 212 via an optical fiber 207-fiber together operative tofacilitate the connection 221-connect.

In a second alternative embodiment to the system 200 described above tocache automatically an external memory element 212, further thesynchronous random-access read cycle 221-tr-R is performed using asignal configuration selected from a group consisting of (i)single-data-rate (SDR), (ii) double-data-rate (DDR), and (iii)quad-data-rate (QDR).

In a third alternative embodiment to the system 200 described above tocache automatically an external memory element 212, further theprolonging 221-tr-R-prolong of the synchronous random-access read cycle221-tr-R is done in order to allow enough time for the system 200 toperform the fetch 212-L1-fetch, and further the synchronousrandom-access read cycle 221-tr-R is allowed to conclude at such timethat said serving 212-D1-serve is possible, thereby ending saidprolonging 221-tr-R-prolong.

In one possible variation of the third alternative embodiment justdescribed, further the synchronous random-access read cycle 221-tr-R isperformed over a double-data-rate (DDR) bus configuration, and theprolonging 221-tr-R-prolong is done using a procedure selected from agroup consisting of: (i) manipulating a data strobe signal belonging tosaid DDR bus configuration, (ii) manipulating an error signal belongingto said DDR bus configuration, (iii) reducing dynamically a clock frameof the DDR bus configuration, (iv) adjusting dynamically a latencyconfiguration associated with said DDR bus configuration, and (v) anygeneral procedure operative to affect timing of said synchronousrandom-access read cycle 221-tr-R.

In a fourth alternative embodiment to the system 200 described above tocache automatically an external memory element 212, further a systemcontroller 200-cont is included and configured to fetch 212-Li-fetch-addadditional data elements 212-Dn respectively from additional memorylocations 212-Ln of the external memory element 212 where the additionalmemory locations are estimated based at least in part on the firstmemory location 212-L1 and the memory locations are to be accessed inthe future by said compute element 200-c 1, and write 212-Dn-write theadditional data elements 212-Dn fetched to the first random-accessmemory 220-R1 thereby caching automatically the additional memorylocations 212-Ln for faster future access by the first compute element.

In one possible variation of the fourth alternative embodiment justdescribed, further the writing 212-Dn-write of the additional dataelements 212-Dn is operated concurrently with additional 221-tr-R-W-addsynchronous random-access read cycles or synchronous random-access writecycles made by the first compute element 200-c 1 in conjunction with thefirst interface 221-i 1 and the first random-access memory 220-R1.

In one possible configuration of the possible variation just described,further the concurrent operation is made possible at least in part bythe first random-access memory 220-R1 being a dual-ported random-accessmemory.

One embodiment is a system 300 configured to cache a shared memory pool312 using at least two memory modules, including a first compute element300-c 1 and a second computer element 300-cn which are associated with,respectively, a first memory module 320-m 1 and a second memory module320-mn memory module, where each of the compute elements is configuredto communicate with its respective memory module using synchronousrandom access transactions 321-tr. Also, a shared memory pool 312connected with the first 320-m 1 and second 320-mn memory modules via afirst data link 331-DL1 and a second data link 331-DLn, respectively. Insome embodiments, the system 300 is configured to use the first 320-m 1and second 320-mn memory modules as a cache to the shared memory pool312, such that sets of data 312-D1 cached on the first 320-m 1 or second320-mn memory modules are read 321-tr-R by the respective computeelement using the synchronous random access transactions 321-tr, andother sets of data 312-D2 that are not cached on the first 320-m 1 orsecond 320-mn memory modules are fetched 331-DL1-fetch from the sharedmemory pool 312 into the first 320-m 1 or the second 320-mn memorymodule upon demand from the memory module's respective compute element.

In one alternative embodiment to the system 300 just described to cachea shared memory pool 312 using at least two memory modules, further thefirst 320-m 1 memory module is a first dual-in-line-memory-module (DIMM)300-DIMM-1.

In one possible variation of the alternative embodiment just described,further the first compute element 300-c 1 is placed on a firstmotherboard 300-MB-1, the first dual-in-line-memory-module 300-DIMM-1 isconnected to the first motherboard 300-MB-1 via a firstdual-in-line-memory-module slot 300-DIMM-1-slot, and the first data link331-DL1 includes a first optical fiber 307-fiber-1.

In one possible configuration of the possible variation just described,further, the second 320-mn memory module is a seconddual-in-line-memory-module 300-DIMM-n, the second compute element 300-cnis placed on a second motherboard 300-MB-n, the seconddual-in-line-memory-module 300-DIMM-n is connected to the secondmotherboard 300-MB-n via a second dual-in-line-memory-module slot300-DIMM-n-slot, the second data link 331-DLn includes a second opticalfiber 307-fiber-n, the first 300-MB-1 and second 300-MB-n motherboardare placed in a first 300-S-1 and a second 300-S-n server, respectively,and the shared memory pool is placed in a third server 300-serverthereby facilitating distributed operation and memory disaggregation.

In a second alternative embodiment to the system 300 described above tocache a shared memory pool 312 using at least two memory modules,further the first memory module 320-m 1 includes a first random-accessmemory 320-R1 operative to cache the sets of data 312-D1, a firstinterface 321-i 1 configured to communicate with the first computeelement 300-c 1 using the synchronous random access transactions 321-tr,and a second interface 321-i 2 configured to transact with the externalshared memory pool 312 via the first data link 331-DL1.

In a third alternative embodiment to the system 300 described above tocache a shared memory pool 312 using at least two memory modules,further the sets of data 312-D1 and other sets of data 312-D2 arearranged in a page format 312-P1 and 312-Pn, respectively. In someembodiments, the system 300 is further configured to conclude that atleast some of the other sets of data 312-D2 are currently not cached onsaid first memory module 320-m 1, to issue in the first compute element300-c 1 a page fault condition, to fetch 331-DL1-fetch by the firstcompute element 300-c 1 at least one page 312-Pn from said shared memorypool 312 where the at least one page 312-Pn contains at least some ofthe other sets of data 312-D2, and cache the at least one page 312-Pn insaid first memory module 320-m 1 for further use.

In a fourth alternative embodiment to the system 300 described above tocache a shared memory pool 312 using at least two memory modules,further the first memory module 320-m 1 is configured to facilitate thereading 321-tr-R of the sets of data 312-D1 concurrently with thefetching 331-DL1-fetch of the other sets of data 312-D2, such that thefetching 331-DL1-fetch of the other sets of data 312-D2 does not reducedata throughput associated with the readings 321-tr-R.

In one possible variation of the fourth alternative embodiment justdescribed, further, the first memory module 320-m 1 comprises a firstrandom-access memory 320-R1 including a first 320-D1 and a second 320-D2bank of dynamic-random-access-memory (DRAM). In some embodiments, theconcurrency is facilitated by the reading 321-tr-R in FIG. 8H made fromthe first bank 320-D1 in FIG. 8H when the fetching 331-DL1-fetch in FIG.8H is done with the second bank 320-D2 in FIG. 8H, and by the reading321-tr-R FIG. 8I made from the second bank 320-D2 in FIG. 8I when thefetching 331-DL1-fetch in FIG. 8I is done with the first bank 320-D1 inFIG. 8I, effectively facilitating operation of the first random-accessmemory 320-R1 as a dual-ported random-access memory.

One embodiment is a system 400 configured to propagate data among aplurality of compute elements via a shared memory pool 412, including aplurality of compute elements 400-c 1, 400-cn associated with,respectively, a plurality of memory modules 420-m 1, 420-mn, where eachcompute element is configured to exchange 409-ex 1 data 412-D1 with itsrespective memory module using synchronous random access memorytransactions 421-tr. In this embodiment, further a shared memory pool412 is connected with the plurality of memory modules 420-m 1, 420-mnvia a plurality of data links 431-DL1, 431-DLn, respectively. In someembodiments, the system 400 is configured to use the plurality of datalinks 431-DL1, 431-DLn to further exchange 409-ext the data 412-D1between the plurality of memory modules 420-m 1, 420-mn and the sharedmemory pool 412, such that at least some of the data 412-D1 propagatesfrom one 400-c 1 of the plurality of compute elements to the sharedmemory pool 412 and from the shared memory pool 412 to another one400-cn of the plurality of compute elements.

One embodiment is a system 500 configured to allow a plurality ofcompute elements concurrent access to a shared memory pool 512,including a switching network 550 operative to transport concurrentlysets of data 512-D1, 512-D2, 512-Dn associated with a plurality ofmemory transactions 512-D1-TR, 512-D2-TR, 512-Dn-TR. In this embodiment,further a first plurality of data interfaces 529-1, 529-2, 529-nconfigured to connect, respectively, a plurality of compute elements500-c 1, 500-c 2, 500-cn with the switching network 500. In thisembodiment, further a shared memory pool 512 including a plurality ofmemory modules 540-m 1, 540-m 2, 540-mk, connected to the switchingnetwork 550 via a second plurality of data interfaces 523-1, 523-2,523-k respectively, wherein the shared memory pool 512 is configured tostore or serve the sets of data 512-D1, 512-D2, 512-Dn concurrently byutilizing the plurality of memory modules concurrently, therebyfacilitating a parallel memory access by the plurality of computeelements 500-c 1, 500-c 2, 500-cn in conjunction with the plurality ofmemory transactions 512-D1-TR, 512-D2-TR, 512-Dn-TR via the switchingnetwork.

One alternative embodiment to the system just described 500 to allow aplurality of compute elements concurrent access to a shared memory pool512, further including a plurality of servers 500-S-1, 500-S-2, 500-S-nhousing respectively the plurality of compute elements 500-c 1, 500-c 2,500-cn, and a memory-server 500-S-memory housing the switching network550 and the second plurality of data interfaces 523-1, 523-2, 523-k. Insome embodiments, the first plurality of data interfaces 529-1, 529-2,529-n includes respectively a plurality of optical fibers 507-fiber-1,507-fiber-2, 507-fiber-n configured to transport the plurality of memorytransactions 512-D1-TR, 512-D2-TR, 512-Dn-TR between the plurality ofservers 500-S-1, 500-S-2, 500-S-n and the memory-server 500-S-memory. Insome embodiments, the at least one of the first plurality of datainterfaces 529-1, 529-2, 529-n is a shared input-output medium. In someembodiments, at least one of the plurality of memory transactions512-D1-TR, 512-D2-TR, 512-Dn-TR is done in conjunction with at least oneof the plurality of compute elements 500-c 1, 500-c 2, 500-cn usingsynchronous random access transactions.

In a second alternative embodiment to the system 500 described above toallow a plurality of compute elements concurrent access to a sharedmemory pool 512, further the first plurality of data interfaces 529-1,529-2, 529-n include at least 8 (eight) data interfaces, the pluralityof memory modules 540-m 1, 540-m 2, 540-mk include at least 8 (eight)memory modules, and the plurality of memory transactions 512-D1-TR,512-D2-TR, 512-Dn-TR has an aggregated bandwidth of at least 400Giga-bits-per-second.

In a third alternative embodiment to the system 500 described above toallow a plurality of compute elements concurrent access to a sharedmemory pool 512, further each of the plurality of memory modules 540-m1, 540-m 2, 540-mk is a dynamic-random-access-memory accessed by therespective one of the second plurality of data interfaces 523-1, 523-2,523-k using synchronous random access memory transactions, and thelatency achieved with each of the plurality of memory transactions512-D1-TR, 512-D2-TR, 512-Dn-TR is lower than 2 (two) microseconds.

In a fourth alternative embodiment to the system 500 described above toallow a plurality of compute elements concurrent access to a sharedmemory pool 512, further the switching network 550 is a switchingnetwork selected from a group consisting of: (i) a non-blockingswitching network, (ii) a fat tree packet switching network, (iii) across-bar switching network, and (iv) an integrated-circuit (IC)configured to multiplex said sets of data 512-D1, 512-D2, 512-Dn inconjunction with said plurality of memory modules 540-m 1, 540-m 2,540-mk thereby facilitating said transporting concurrently of said setsof data 512-D1, 512-D2, 512-Dn.

In a fifth alternative embodiment to the system 500 described above toallow a plurality of compute elements concurrent access to a sharedmemory pool 512, further including a second plurality of serves 540-S-1,540-S-2, 540-S-k housing respectively the plurality of memory modules540-m 1, 540-m 2, 540-mk In some embodiments, the second plurality ofdata interfaces 523-1, 523-2, 523-k includes respectively a plurality ofoptical fibers 517-fiber-1, 517-fiber-2, 517-fiber-k configured totransport the plurality of memory transactions 512-D1-TR, 512-D2-TR,512-Dn-TR between the second plurality of servers 540-S-1, 540-S-2,540-S-k and the switching network 550.

FIG. 11A illustrates one embodiment of a system 600 configured to use acompute element to process a plurality of values distributed over aplurality of servers using a plurality of keys. The system 600 includesa cache memory 601, and a first compute element 601-c 1 associated withand in communicative contact with the cache memory 601. The firstcompute element 601-c 1 includes two or more keys, 618-k 1, 618-k 2,618-k 3, where each key is associated with a respective data value,618-k 1 with 618-v 1, 618-k 2 with 618-v 2, and 618-k 3 with 618-v 3.The data values are stored in multiple servers. In FIG. 11A, 618-v 1 isstored in first server 618 a, 618-v 2 is stored in second server 618 b,and 618-v 3 is stored in third server 618 c. It will be understood,however, that two or more specific data values may be served in a singleserver, although the entire system 600 includes two or more servers. Theservers as a whole are a server stack that is referenced herein as adistributed key-value-store (KVS) 621. The first compute element 600-c 1and the distributed KVS 621 are in communicative contact through aswitching network 650, which handles requests for data values from thefirst compute element 600-c 1 to the KVS 621, and which handles alsodata values sent from the KVS 621 to either the first compute element600-c 1 or the cache memory 601. In some embodiments, the system 600includes also a direct-memory-access (DMA) controller 677, whichreceives data values from the switching network 650, and which may passsuch data values directly to the cache memory 601 rather than to thefirst compute element 600-c 1, thereby temporarily freeing the firstcompute element 600-c 1 to perform work other than receiving andprocessing a data value. The temporary freeing of the first computeelement 600-c 1 is one aspect of system 600 timing that facilitates ahigher utilization rate for the first compute element 600-c 1. In someembodiments, the system 600 includes also a network-interface-card (NIC)667, which is configured to associate the first compute element 600-c 1and the cache memory 601 with the switching network 650. In someembodiments, the NIC 667 is further configured to block or delay anycommunication currently preventing the NIC 667 from immediately sendinga request for data value from the first compute element 600-c 1 to theKVS 621, thereby preventing a situation in which the first computeelement 600-c 1 must wait before sending such a request. This blockingor delaying by the NIC 667 facilitates efficient usage and a higherutilization rate of the first compute element 600-c 1. In FIG. 11A, theorder of structural elements between cache memory 601 and first computeelement 600-c 1 on the one hand and the KVS 621 on the other hand is DMAcontroller 677, then NIC 667, then switching network 650, but this isonly one of many possible configurations, since any of the threeelements 677, 667, or 650, may be either on the left, or in the middle,or on the right, and indeed in alternative embodiments, the DMAcontroller 677 and NIC 667 may be parallel, such that they are not indirect contact with one another but each one is in contact with theswitching network 667 and with either the cache memory 601 or the firstcompute element 600-c 1 or with both the cache memory 601 and the firstcompute element 600-c 1.

In some embodiments of FIG. 11A, the KVS 621 is a shared memory pool 512from FIG. 10B, which includes multiple memory modules 540-m 1, 540-m 2,540-mk, where each memory module is associated with a particular server.In FIG. 11A as shown, memory module 540-m 1 would be associated withfirst server 618 a, memory module 540-m 2 would be associated withsecond server 618 b, and memory module 540-mk would be associated withthird server 618 c. However, many different configurations are possible,and a single server may include two or more memory modules, providedthat the entire system includes a multiplicity of memory modules and amultiplicity of servers, and that all of the memory modules are includedin at least two servers. In a configuration with memory modules, thedata values are stored in the memory modules, for example data value618-v 1 in memory module 540-m 1, data value 618-v 2 in memory module540-m 2, and data value 618-v 3 in memory module 540-mk, but this isonly one of multiple possible configurations, provided that all of thedata values are stored in two or more memory modules that are located intwo or more servers. In some embodiments, one or more of the multiplememory modules 540-m 1, 540-m 2, 540-mk, are based onrandom-access-memory (RAM), which may be a dynamic RAM (DRAM) or a flashmemory in two non limiting examples, and at least as far as read cyclesare concerned, thereby facilitating the execution of data value requestsfrom the first compute element 600-c 1. In some embodiments, a memorymodule can execute a data value request in a period between 200 and2,500 nanoseconds.

FIG. 11B illustrates one embodiment of a system configured to requestand receive data values needed for data processing. FIG. 11B illustratestwo transfers of information, one at the top and one at the bottom,although both transfers pass through the switching network 650. At thetop, cache memory 601 receives 618-get 1 a first data value 618-v 1which was sent by the first server 618 a to the switching network 650.In some embodiments, the first data value 618-v 1 is sent directly fromthe switching network to the cache memory 601, while in otherembodiments the first data value 618-v 1 is sent from the switchingnetwork to a DMA controller 677 (or rather pulled by the DMA controller)and then to the cache memory 601, while in other embodiments the firstdata value 618-v 1 is sent from the switching network 650 directly tothe first compute element 600-c 1, and in other embodiments the firstdata value 618-v 1 is sent from the switching network 650 to a DMAcontroller 677 and then to the first compute element 600-c 1.

In FIG. 11B, in the bottom transfer of information, a first computeelement 600-c 1 uses a key, here 618-k 2 to identify the server locationof a needed data value, here second data value 618-v 2. The firstcompute element 600-c 1 then sends a request 600-req 2 to receive thisdata value 618-v 2, where such request 600-req 2 is sent to theswitching network 650 and then to the server holding the data value618-v 2, here second server 618 b.

FIG. 11C illustrates one embodiment of a system configured to streamlinea process of retrieving a plurality of values from a plurality ofservers using a plurality of keys. In FIG. 11C, the system 600 isconfigured to perform four general tasks:

to use keys 618-k 2, 618-k 3, to derive 600-c 1-der-s 2, 600-c 1-der-s 3identities of servers holding needed data values,

-   -   to send requests 600-req 2, 600-req 3 for needed data values to        the specific servers in the KVS 621 holding the needed data        values,    -   to receive the needed data values 618-get 1, 618-get 2 from the        servers via the switching network 650 or the DMA controller 677        or the cache memory 601, and    -   to process 600-c 1-pro-v 1, 600-c 1-pro-v 2 the received data        values as required.        In some embodiments, the first compute element 600-c 1 is        dedicated to the four general tasks described immediately above.        Dedications to these tasks can enhance the utilization rate of        the first compute element 600-c 1, and thereby increase the        relative efficiency of its usage.

In the specific embodiment shown in FIG. 11C, time flows from the top tothe bottom, actions of the first compute element 600-c 1 are illustratedon the left, actions of the second server 618 b are illustrated on theright, and interactions between the first compute element 600-c 1 andthe second server 618 b are illustrated by lines pointing between thesetwo structures in which information transfers are via the switchednetwork 650. The server location (e.g. the address of the server)associated with a second needed data value is derived 600-c 1-der-s 2 bythe first compute element 600-c 1, after which the first compute element600-c 1 receives 618-get 1 a first needed data value that was previouslyrequested, and the first compute element 600-c 1 sends a new request fora second needed data value 600-req 2 to the second server 618 b, afterwhich the first compute element 600-c 1 processes the first data value600-c 1-pro-v 1, and the first compute element derives the serverlocation of a third needed data value 600-c 1-der-s 3, after which thefirst compute element 600-c 1 receives 618-get 2 the second needed datavalue, and the first compute element sends a future request 600-req 3for the third needed data value, after which the first compute elementprocesses the second needed data value 60-c 1-pro-v 2.

After the second server 618 b receives from the switching network 650the new request for a second needed data value 600-req 2, the secondserver 618 b executes this request 600-req 2-exe by locating, optionallyusing the second key which is included in the new request 600-req 2, theneeded data value within the server 618 b and preparing to send it tothe switching network 650. The period of time from which the firstcompute element 600-c 1 sends a new request for a second needed datavalue 600-req 2 until that request is received by the second server 618b is a request propagation time 600-req 2-prop. During the propagationperiod 600-req 2-prop, the period during which the second server 618 bexecutes the data request 600-req 2-exe, and the time period 618-get 2during which the second needed data value is transferred from the secondserver 618 b to the first compute element 600-c 1, the first computeelement 600-c 1 processes the first needed data value 600-c 1-pro-v 1and, in a first period 699, derives the server location of the thirdneeded data value 600-c 1-der-s 3. This interleaving of activity betweenthe various structural elements of the system 600 increases theutilization rate of the first compute element 600-c 1 and therebyenhances the efficient usage of the first compute element 600-c 1.

In the embodiment illustrated in FIG. 11C, processing of the firstneeded data value 600-c 1-pro-v 1 occurs before the derivation of serverlocation for the third needed data value 600-c 1-der-s 3. This is onlyone of multiple embodiments. In some alternative embodiments, thederivation of server location for the third needed data value 600-c1-der-s 3 occurs before the processing of the first needed data value600-c 1-pro-v 1. In other alternative embodiments, the processing of thefirst needed data value 600-c 1-pro-v 1 occurs in parallel with thederivation of the server location for the third needed data value 600-c1-der-s 3. All of these embodiments are possible, because in all of themthe first compute element 600-c 1 continues to be utilized, which meansthat the first compute element's 600-c 1 utilization rate is relativelyhigh, and therefore its usage is relatively efficient.

FIG. 11D illustrates one embodiment of a system configured to minimizeor at least reduce the duration of time periods between general tasksexecuted by a first compute element. In some embodiments, a firstcompute element 600-c 1 is dedicated to the four general tasks describedwith respect to FIG. 11C above. In the specific embodiment illustratedin FIG. 11D, a first compute element 600-c 1 is operating over time. Thefirst compute element 600-c 1 receives 618-get 1 a first needed datavalue. There is a second period 698 after receipt 618-get 1 of the firstneeded data value but before the first compute element 600-c 1-prov-v 1processes that first needed data value. There is then a third period 697after the first compute element 600-c 1 has processed the first neededdata value 600-c 1-pro-v 1 but before the first compute element 600-c 1derives the server location of a third needed data value 600-c 1-der-s3. To increase system efficiency, it would be desirable to minimize, orat least to reduce the duration, of either or both of the second period698 and the third period 697. The implementation of the four generaltasks by the first compute element 600-c 1, as presented and explainedin reference to FIG. 11C, will minimize or at least reduce the durationof either or both of the second period 698 and the third period 697, andin this way increase the utilization rate of the first compute element600-c 1 and hence the relative efficiency in the usage of the firstcompute element 600-c 1. In some alternative embodiments, the firstcompute element 600-c 1 derives the server location of a third neededdata value 600-c 1-der-s 3 before it processes the first needed datavalue 600-c 1-pro-v 1, in which case the second period 698 is between618-get 1 and 600-c 1-der-s 3 and the third period 697 is immediatelyafter 600-c 1-pro-v 1.

FIG. 11E illustrates one embodiment of a system configured to increasethe utilization rate of a first compute element. In some embodiments, afirst compute element 600-c 1 is dedicated to the four general tasksdescribed with respect to FIG. 11C above. In the specific embodimentillustrated in FIG. 11E, a first compute element 600-c 1 is operatingover time. After sending a new request for a second needed data value600-req 2, the first compute element 600-c 1 processes the first neededdata value 600-c 1-pro-v 1 and derives the server location of a thirdneeded data value 600-c 1-der-s 3, either in the order shown in FIG.11E, or by deriving the third needed data value 600-c 1-der-s 3 prior toprocessing the first needed data value 600-c 1-pro-v 1, or by performingboth operations in a parallel manner. The duration of time during whichthe first compute element 600-c 1 both processes the first needed datavalue 600-c 1-pro-v 1 and derives the server location of the thirdneeded data value 600-c 1-der-s 3, in whatever chronological order, isperiod 696. In one embodiment, as a result of one or more of thededication of the first compute element 600-c 1 to the four generaltasks, and/or the simultaneous operation of the first compute element600-c 1 and the second server 618 b as illustrated and described in FIG.11C, and/or of the operation of the cache memory in receiving some ofthe data values as illustrated and described in FIG. 11A, the firstcompute element 600-c 1 consumes at least 50 (fifty) percent of the timeduring period 696 performing the two tasks 600-c 1-pro-v 1 and 600-c1-der-s 3. This is a relatively high computational duty-cycle, and itallows the first compute element 600-c 1 to process a plurality of keys,618-k 1, 618-k 2, 618-k 3 from FIG. 11A, and a plurality of values,618-v 1, 618-v 2, 618-v 3, from FIG. 11A, at an increased and relativelyhigh rate, thus enhancing the relative efficiency of the first computeelement 600-c 1.

FIG. 11F illustrates one embodiment of a system configured to achieve arelatively high computational duty-cycle by at least temporarilyblocking or redirecting the execution of certain processes. In FIG. 11F,there is a central-processing-unit (CPU) 600-CPU that includes at leasta cache memory 601, a first compute element 600-c 1, and a secondcompute element 600-c 2. The first compute element 600-c 1 includes aplurality of keys, 618-k 1, 618-k 2, 618-k 3, each of which isassociated with a corresponding data value stored in a server (such datavalues and servers not shown in FIG. 11F). The first compute element600-c 1 executes the general tasks illustrated and described in FIG.11C. The second compute element 600-c 2 executes certain processes thatare unrelated 600-pr to the general tasks executed by the first computeelement 600-c 1. The system includes also an operating system 600-OSconfigured to control and manage the first 600-c 1 and second 600-c 2compute elements. The operating system 600-OS is further configured tomanage the general tasks executed by the first compute element 600-c 1and the unrelated processes 600-pr that are executed by the secondcompute element 600-c 2. The operating system 600-OS is furtherconfigured to help achieve dedication of the first compute element 600-c1 to the general tasks by blocking the unrelated processes 600-pr fromrunning on the first compute element 600-c 1, or by causing theunrelated processes 600-pr to run on the second compute element 600-c 2,or both blocking or directing to the second compute element 600-c 2depending on the specific process, or on the time constraints, or uponthe system characteristics at a particular point in time.

In one embodiment, at least part of cache memory 601 is dedicated forusage by only the first compute element 600-c 1 in conjunction withexecution of the general tasks illustrated and described in FIG. 11C,thus ensuring performance and timing in accordance with someembodiments.

It will be understood that the particular embodiment illustrated in FIG.11F is only one of multiple possible embodiments. In some alternativeembodiments, there is only a single compute element, but some of itssub-structures are dedicated to the general tasks illustrated anddescribed in FIG. 11C, whereas other of its sub-structures executedunrelated processes. In some alternative embodiments, there are twocompute elements, in which some sub-structures of a first computeelement 600-c 1 are dedicated to general tasks while others executeunrelated tasks, and similarly some sub-structures of a second computeelement 600-c 2 are dedicated to general tasks while others executeunrelated tasks. In some alternative embodiments, differentsub-structures within a compute element are either dedicated to generaltasks or execute unrelated processes, but the status of a particularsub-structure will change over time depending on system characteristics,processing demands, and other factors, provided that every instant oftime there are some sub-structures that perform only general tasks whileother sub-structures execute only unrelated processes.

One embodiment is a system 600 operative to efficiently use a computeelement to process a plurality of values distributed over a plurality ofservers using a plurality of keys, including a first compute element600-c 1 associated with a first cache memory 601, and a distributedkey-value-store (KVS) 621 including a plurality of servers 618 a, 618 b,618 c configured to store a plurality of values 618-v 1, 618-v 2, 618-v3 associated with a plurality of keys 618-k 1, 618-k 2, 618-k 3, inwhich the plurality of servers is communicatively connected with saidfirst cache memory 601 via a switching network 650. Further, the systemis configured to send, from the first compute element 600-c 1, to asecond 618 b of the plurality of servers identified 600-c 1-der-s 2using a second 618-k 2 plurality of keys, via said switching network650, a new request 600-req 2 to receive a second 618-v 2 of theplurality of values associated with the second key 618-k 2. Further, thesystem is configured to receive 618-get 1, via said switching network650, from a first 618 a of said plurality of servers, into said firstcache memory 601, a first 618-v 1 of said plurality of values previouslyrequested. Further, after completion of the operations just described,the system is further configured to process 600-c 1-pro-v 1 in the firstcompute element 600-c 1, in conjunction with the first cache memory 601,the first value 618-v 1 received, simultaneously with the second server618 b and switching network 650 handling the new request 600-req 2. Thesystem is further configured to derive 600-c 1-der-s 3, in the firstcompute element 600-c 1, from a third 618-k 3 plurality of keys, duringa first period 699 prior to receiving 618-get 2 and processing 600-c1-pro-v 2 the second value 618-v 2, an identity of a third 618 c of theplurality of servers into which to send a future request 600-req 3 for athird 618-v 3 of said plurality of values, thereby facilitating saidefficient usage.

In one alternative embodiment to the system just described toefficiently use a compute element, the handling includes (i) propagation600-req 2-prop of the new request 600-req 2 via the switching network650, and (ii) executing 600-req 2-exe the new request 600-req 2 by thesecond server 618 b.

In one possible configuration of the alternative embodiment justdescribed, (i) the propagation 600-req 2-prop takes between 150 to 2,000nanoseconds, (ii) the executing 600-req 2-exe of the new request 600-req2 takes between 200 and 2,500 nanoseconds, and (iii) the processing600-c 1-pro-v 1 takes between 500 and 5,000 nanoseconds. In this way,the processing 600-c 1-pro-v 1 may extends over a period that is similarin magnitude to the handling, thereby making said simultaneity possiblymore critical for achieving the efficient usage. In one possibleembodiment of the possible configuration described herein, thedistributed key-value-store 621 is a shared memory pool 512 thatincludes a plurality of memory modules 540-m 1, 540-m 2, 540-mk, whereineach of the plurality of servers 618 a, 618 b, 618 c is associated withat least one of said plurality of memory modules 540-m 1, 540-m 2,540-mk, and wherein the plurality of values 618-v 1, 618-v 2, 618-v 3are stored in the plurality of memory modules 540-m 1, 540-m 2, 540-mk.

In possible variation of the possible configuration described above, theplurality of memory modules 540-m 1, 540-m 2, 540-mk are based onrandom-access-memory, thereby facilitating the executing 600-req 2-exeof the new request 600-req 2 taking between 200 and 2,500 nanoseconds.This possible variation may be implemented whether or not thedistributed key-value-store 621 is a shared memory pool 512.

In a second alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys, thesystem 600 is further configured to dedicate the first compute element600-c 1 for: (i) sending any one of the requests 600-req 2, 600-req 3 toreceive respectively any one of the plurality of values 618-v 2, 618-v3, (ii) processing 600-c 1-pro-v 1, 600-c 1-pro-v 2 any one of theplurality of values 618-v 1, 618-v 2, and (iii) deriving 600-c 1-der-s2, 600-c 1-der-s 3 identities of any one of the plurality of servers 618b, 618 c using respectively any one of the plurality of keys 618-k 2,618-k 3. In this way, there are minimized at least: (i) a second period698 between the receiving 618-get 1 and the processing 600-c 1-pro-v 1,and (ii) a third period 697 between the processing 600-c 1-pro-v 1 andthe deriving 600-c 1-der-s 3. This minimization of (i) and (ii)facilitates the efficient usage of a compute element 600-c 1.

In a first variation to the second alternative embodiment describedabove, The system further includes a second compute element 600-c 2,together with the first compute element 600-c 1 belonging to a firstcentral-processing-unit (CPU) 600-CPU, and an operating-system (OS)600-OS configured to control and manage the first 600-c 1 and second600-c 2 compute element, wherein the operating-system 600-OS is furtherconfigured to manage a plurality of processes comprising: (i) saidsending 600-req 2, receiving 618-get 1, processing 600-c 1-pro-v 1, andderiving 600-c 1-der-s 3, and (ii) other unrelated processes 600-pr.Also, the operating-system 600-OS is further configured to achieve thededication by blocking the other unrelated processes 600-pr from runningon said first compute element 600-c 1, and by causing the otherunrelated processes 600-pr to run on the second compute element 600-c 2.

In a second variation to the second alternative embodiment describedabove, as a result of the dedication, the simultaneity, and the firstcache memory 601, the derivation 600-c 1-der-s 3 and the processing600-c 1-pro-v 1 together account for at least 50 (fifty) per-cent oftime spent by the first compute element 600-c 1 over a period 696extending from a beginning of said sending 600-req 2 to an end of saidderiving 600-c 1-der-s 3. This utilization rate thereby achieves a highcomputational duty-cycle, which thereby allows the first compute element600-c 1 to process the plurality of keys 618-k 1, 618-k 2, 618-k 3 andvalues 618-v 1, 618-v 2, 618-v 3 at an increased rate.

In a first configuration to the second variation to the secondalternative embodiment, described above, further the period 696extending from the beginning of the sending to the end of the deriving,is less than 10 (ten) microseconds.

In a second configuration to the second variation to the secondalternative embodiment, described above, further the increased ratefacilitates a sustained transaction rate of at least 100,000 (onehundred thousand) of the plurality of keys and values per second.

In a third alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys,further the derivation is done by applying on the third key 618-k 3 atechnique selected from a group consisting of: (i) hashing, (ii)table-based mapping, and (iii) any mapping technique either analyticalor using look-up tables.

In a fourth alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys,further the first compute element 600-c 1 and the first cache memory 601belong to a first central-processing-unit (CPU) 600-CPU, such that thefirst compute element 600-c 1 has a high bandwidth access to the firstcache memory 601, thereby allowing the processing 600-c 1-pro-v 1 toconclude in less than 5 (five) microseconds.

In one possible configuration of the fourth alternative embodiment justdescribed, the high bandwidth is more than 100 (one hundred)Giga-bits-per-second.

In a fifth alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys, thesystem further comprises a direct-memory-access (DMA) controller 677configured to receive 618-get 1 the first value 618-v 1 via theswitching network 650 directly into the first cache memory 601.

In one a variation of the fifth alternative embodiment just described,further the direct-memory-access controller 677 frees the first computeelement 600-c 1 to perform the identification 600-c 1-der-s 2 of thesecond server 618 b simultaneously with the receiving 618-get 1 of thefirst value 618-v 1. In this way, the efficient usage is facilitated.

In a sixth alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys, thesystem 600 is further configured to send to the third 618 c of theplurality of servers identified, via said switching network 650, thefuture request 600-req 3 to receive the third value 618-v 3, and toreceive 618-get 2, via the switching network 650, from the second server618 b, into the first cache memory 601, the second value 618-v 2. Thesystem is also configured, after completion of the send and receiveoperations just described, to process 600-c 1-pro-v 2 the second value618-v 2 received, simultaneously with the third server 618 c andswitching network 650 handling of the future request 600-req 3.

In a seventh alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys,system 600 further comprises a network-interface-card (NIC) 667configured to associate the first compute element 600-c 1 and the firstcache memory 601 to the said switching network 650. Also, thenetwork-interface-card 667 is further configured to block or delay anycommunication currently preventing the network-interface-card 667 fromimmediately performing the sending 600-req 2, thereby preventing thefirst compute element 600-c 1 from waiting before performing saidsending, thereby facilitating the efficient usage of the first computeelement 600-c 1.

In an eighth alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys,further the deriving 600-c 1-der-s 3 is done simultaneously with thesecond server 618 b and the switching network 650 handling of the newrequest 600-req 2.

In a ninth alternative embodiment to the system described above toefficiently use a compute element to process a plurality of valuesdistributed over a plurality of servers using a plurality of keys, thesystem 600 further comprises a direct-memory-access (DMA) controller 677configured to receive 618-get 2 the second value 618-v 2 via theswitching network 650 directly into the first cache memory 601, whereinthe direct-memory-access controller 677 frees the first compute element600-c 1 to perform the processing 600-c 1-pro-v 1 simultaneously withthe receiving 618-get 2 of the second value 618-v 2. The operationdescribed in this ninth alternative embodiment thereby facilitatesefficient usage of the first compute element 600-c 1.

In the various system embodiment described above, the processing 600-c1-pro-v 1 is depicted as occurring before the deriving 600-c 1-der-s 3.However, this particular order of events is not required. In variousalternative embodiments, the deriving 600-c 1-der-s 3 occurs before theprocessing 600-c 1-pro-v 1. Also, in different alternative embodiments,the deriving 600-c 1-der-s 3 occurs in parallel with the processing600-c 1-pro-v 1.

FIG. 12 illustrates one embodiment of a method for mixing and timing,relatively efficiently, at least two key-value transactions inconjunction with a distributed key-value-store (KVS) 621. In step 1031:a direct-memory-access (DMA) controller 677, starts a first process ofreceiving 618-get 1 via a switching network 650, from a first 618 a of aplurality of servers 618 a, 618 b, 618 c directly into a first cachememory 601 associated with a first compute element 600-c 1, a first618-v 1 of a plurality of values 618-v 1, 618-v 2, 618-v 3 previouslyrequested and associated with a first 618-k 1 of a plurality of keys618-k 1, 618-k 2, 618-k 3. In step 1032: a first compute element 600-c 1derives 600-c 1-der-s 2 from a second 618-k 2 of the plurality of keys,simultaneously with at least one part of the first process, an identityof a second 618 b of the plurality of servers into which to send a newrequest 600-req 2 for a second 618-v 2 of said plurality of values. Instep 1033: the first compute element 600-c 1 sends, via the switchingnetwork 650, to the second server 618 b identified, the new request600-req 2. In step 1034: the direct-memory-access controller 677finishes the first process of receiving 618-get 1 the requested dataelement. In step 1035: the first compute element 600-c 1 processes 600-c1-pro-v 1 the first value 618-v 1 received, simultaneously with thesecond server 618 b and the switching network 650 handling the newrequest 600-req 2.

In a first alternative embodiment to the method just described, furtherthe first compute element 600-c 1 derives 600-c 1-der-s 3 from a thirdof the plurality of keys 618-k 3, during a first period 699 prior toreceiving 618-get 2 and processing 600-c 1-pro-v 2 the second value618-v 2, an identity of a third 618 c of the plurality of servers intowhich to send a future request 600-req 3 for a third 618-v 3 of theplurality values.

FIG. 13A illustrates one embodiment of a system 680 configured tointerleave high priority key-value transactions 681-kv-tran togetherwith lower priority transactions 686-tran over a shared input-outputmedium 685. The system 680 includes a plurality of values 618-v 1, 618-v2, 618-v 3, distributed over a plurality of servers 618 a, 618 b, 618 c,using a plurality of keys 618-k 1, 618-k 2, 618-k 3. The system 680includes a cache memory 601, and a first compute element 600-c 1associated with and in communicative contact with the cache memory 601.The first compute element 600-c 1 includes two or more keys, 618-k 1,618-k 2, 618-k 3, where each key is associated with a respective datavalue, 618-k 1 with 618-v 1, 618-k 2 with 618-v 2, and 618-k 3 with618-v 3. The data values are stored in multiple servers. In FIG. 13A,618-v 1 is stored in first server 618 a, 618-v 2 is stored in secondserver 618 b, and 618-v 3 is stored in third server 618 c. It will beunderstood, however, that two or more specific data values may be servedin a single server, although the entire system 680 includes two or moreservers. The servers as a whole are a server stack that is referencedherein as a distributed key-value-store (KVS) 621.

The first compute element 600-c 1 and the distributed KVS 621 are incommunicative contact through a shared input-output medium 685 and amedium controller 685-mc, which together handle requests for data valuesfrom the first compute element 600-c 1 to the KVS 621, and which handlealso data values sent from the KVS 621 to either the first computeelement 600-c 1 or to the cache memory 601. In some embodiments, thesystem 680 includes also a direct-memory-access (DMA) controller 677,which receives data values from the shared input-output medium 685 andmedium controller 685-mc, and which may pass such data values directlyto the cache memory 601 rather than to the first compute element 600-c1, thereby at least temporarily freeing the first compute element 600-c1.

In some embodiments illustrated in FIG. 13A, the KVS 621 is a sharedmemory pool 512 from FIG. 10B, which includes multiple memory modules540-m 1, 540-m 2, 540-mk, and wherein one of the memory modules isconfigured to store the first value 618-v 1. In some embodiments, themultiple memory modules 540-m 1, 540-m 2, 540-mk, are based onrandom-access-memory, thereby facilitating fast extraction of at leastthe desired value 618-v 1. In some embodiments, “fast extraction” can beexecuted in less than 3 (three) microseconds. In some embodiments, theblocking of lower priority transactions 686-tran enables sending of thenew request 600-req 2 from FIGS. 11B and 11C in less than 3 (three)microseconds, thereby matching timing of the extraction, andconsequently thereby facilitating overall fast key-value transactions618-kv-tran, each such fast transaction taking less than 10 (ten)microseconds.

FIG. 13B illustrates one embodiment of a system configured to interleavehigh priority key-value transactions 681-kv-tran together with lowerpriority transactions 686-tran over a shared input-output medium, inwhich both types of transactions are packet-based transactions and thesystem is configured to stop packets of the lower priority transactions686-tran in order to commence communication of packets of the highpriority transactions 681-kv-tran. In FIG. 13B, the first transactionprocessed by the system is one of a plurality of low prioritytransactions 686-tran, including packets P1, P2, and Pn at the top ofFIG. 13B, and the second transaction processed by the system is one of aplurality of high priority key-value transactions 681-kv-tran, includingpackets P1, P2, and Pn at the bottom of FIG. 13B. In the particularembodiment illustrated in FIG. 13B, all of the transactions arepacket-based transactions, and they are performed via a mediumcontroller in the system 685-mc from FIG. 13A in conjunction with ashared input-output medium 685 from FIG. 13A. The medium controller685-mc is configured to stop 686-stop the on-going communication of afirst packet 686-tran-first-P belonging to one of the lower prioritytransactions 686-tran, and immediately thereafter to commencecommunication of a second packet 681-kv-second-P belonging to one of thehigh priority key-value transactions 681-kv-tran. After the secondpacket 681-kv-tran-second-P has been communicated, the medium controller685-mc is configured to resume 686-resume communication of the firstpacket 686-tran-first-P.

FIG. 13C illustrates one embodiment of part of a system configured tointerleave high priority key-value transactions 681-kv-tran togetherwith lower priority transactions 686-tran over a shared input-outputmedium, comprising a network-interface-card (NIC) 685-NIC including amedium-access-controller (MAC) 685-mac. In FIG. 13C, a sharedinput-output medium 685 from FIG. 13A is a network-interface-card685-NIC together with a medium-access-controller (MAC) 685-mac that islocated on the network-interface-card (NIC) 685-NIC. The elements shownhelp communicate both high priority key-value transactions 681-kv-tranand lower priority transactions 686-tran, either of which may becommunicated either (i) from a KVS 621 to a cache 601 or first computeelement 600-c 1, or (ii) from a cache 601 or first compute element 600-c1 to a KVS 621. The lower priority transactions 686-tran are notnecessarily related to KVS 621, and may be, as an example, a generalnetwork communication unrelated with keys or values.

One embodiment is a system 680 configured to interleave high prioritykey-value transactions 681-kv-tran together with lower prioritytransactions 686-tran over a shared input-output medium 685, including ashared input-output medium 685 associated with a medium controller685-mc, a central-processing-unit (CPU) 600-CPU including a firstcompute element 600-c 1 and a first cache memory 601, and akey-value-store (KVS) 621 communicatively connected with thecentral-processing-unit 600-CPU via the shared input-output medium 685.Further, the central-processing-unit 600-CPU is configured to initiatehigh priority key-value transactions 681-kv-tran in conjunction with thekey-value-store (KVS) 621 said shared input-output medium 685, and themedium controller 685-mc is configured to block lower prioritytransactions 686-tran via the shared input-output medium 685 during atleast parts of the high priority key-value transactions 681-kv-tran,thereby achieving the interleaving without delaying the high prioritykey-value transactions 681-kv-tran.

In one alternative to the system 680 to interleave transactions, furtherthe key-value-store (KVS) 621 is configured to store a first value 618-v1 associated with a first key 618-k 1. Further, the high prioritykey-value transactions 681-kv-tran include at least a new request600-req 2 from FIGS. 11B and 11C for the first value 618-v 1, whereinthe new request 600-req 2 is sent from the first compute element 600-c 1to the key-value-store 621 via the shared input-output medium 685, andthe new request 600-req 2 conveys the first key 618-k 1 to thekey-value-store 621.

In some embodiments, the key-value-store (KVS) 621 is a distributedkey-value-store, including a plurality of servers 618 a, 618 b, 618 c.In some forms of these embodiments, the distributed key-value-store is ashared memory pool 512 including a plurality of memory modules 540-m 1,540-m 2, 540-mk, wherein one of the plurality of memory modules isconfigured to store the first value 618-v 1. In some forms of theseembodiments, the plurality of memory modules 540-m 1, 540-m 2, 540-mkare based on random-access-memory, thereby facilitating fast extractionof at least the first value 618-v 1. In some forms of these embodiments,“fast extraction” is done in less than 3 (three) microseconds. In someforms of these embodiments, the blocking of lower priority transactions686-tran enables sending of the new request in less than 3 (three)microseconds, thereby matching timing of the extraction, therebyconsequently facilitating overall fast key-value transactions, eachtransaction taking less than 10 (ten) micro second.

In a second alternative to the system 680 to interleave transactions,further the high priority key-value transactions 681-kv-tran arelatency-critical key-value transactions, and the medium controller685-mc is configured to interrupt any of the lower priority transactions686-tran and immediately commence at least one of the high prioritykey-value transactions 681-kv-tran, thereby facilitating said latencycriticality.

In one possible configuration of the second alternative embodiment justdescribed, further both the high priority key-value transaction681-kv-tran and the lower priority transactions 686-tran arepacket-based transactions performed via the medium controller 685-mc inconjunction with the shared input-output medium 685. Further, the mediumcontroller 685-mc is configured to stop 686-stop on-going communicationof a first packet 686-tran-first-P belonging to the lower prioritytransactions 686-tran via the shared input-output medium 685, andimmediately to commence communication of a second packet681-kv-tran-second-P belonging to the high priority key-valuetransaction 681-kv-tran via the shared input-output medium 685 instead,thereby achieving the communication interruption at the packet level.

In one possible variation of the configuration just described, themedium controller 685-mc is configured to resume 686-resumecommunication of the first packet 686-tran-first-P after the secondpacket 681-kv-tran-second-P has finished communicating, therebyfacilitating packet fragmentation.

In a third alternative to the system 680 to interleave transactions,further the shared input-output medium is based on an interconnectelement selected from a group consisting of: (i)peripheral-component-interconnect-express (PCIE) computer expansion bus105-pcie from FIG. 3A, (ii) Ethernet 105-eth from FIG. 3B, and (iii) anetwork-interface-card (NIC) 685-NIC.

In some embodiments associated with the PCIE computer expansion bus105-pcie from FIG. 3A, the medium controller 685-mc may be implementedas part of a root-complex 105-root from FIG. 3A associated with the PCIEcomputer expansion bus 105-pcie.

In some embodiments associated with the Ethernet 105-eth from FIG. 3B,the medium controller 685-mc may be implemented as part of amedia-access-controller (MAC) 105-mac from FIG. 3B associated with theEthernet 105-eth.

In some embodiments associated with the NIC 685-NIC, the mediumcontroller 685-mc may be implemented as part of amedia-access-controller (MAC) 685-mac associated with the NIC 685-NIC.In some forms of these embodiments, the NIC 685-NIC is in compliancewith Ethernet.

In a fourth alternative to the system 680 to interleave transactions,further both the high priority key-value transactions 681-kv-tran andthe lower priority transactions 686-tran are packet-based transactionsperformed via the medium controller 685-mc in conjunction with theshared input-output medium 685. Further, the medium controller 685-mc isconfigured to deny access to the shared input-output medium 685 from afirst packet 686-tran-first-P belonging to the lower prioritytransactions 686-tran, and instead grant access to the sharedinput-output medium 685 to a second packet 681-kv-tran-second-Pbelonging to the high priority key-value transactions 681-kv-tran,thereby giving higher priority to the high priority key-valuetransactions 681-kv-tran over the lower priority transactions 686-tran.

In a fifth alternative to the system 680 to interleave transactions,further the key-value-store 621 is configured to store a first value618-v 1 associated with a first key 618-k 1. Further, the high prioritykey-value transactions 681-kv-tran include at least sending of the firstvalue 618-v 1 from the key-value-store (KVS) 621 to thecentral-processing-unit 600-CPU via the shared input-output medium 685.

In one possible configuration of the fifth alternative just described,the system includes further a direct-memory-access (DMA) controller 677configured to receive the first value 618-v 1 via the sharedinput-output medium 685 directly into the first cache memory 601.

In a sixth alternative embodiment to the system 680 to interleavetransactions, further the shared input-output medium 685 includes anelectro-optical interface 107-a from FIG. 5A and an optical fiber107-fiber-ab from FIG. 5A which are operative to transport the highpriority key-value transactions 681-kv-tran and the lower prioritytransactions 686-tran.

FIG. 14A illustrates one embodiment of a method for mixing high prioritykey-value transactions 681-kv-tran over a shared input-output medium685, together with lower priority transactions 686-tran over the sameshared input-output medium 685, without adversely affecting systemperformance. In step 1041, a medium controller 685-mc associated with ashared input-output medium 685 detects that a second packet681-kv-tran-second-P associated with high priority key-valuetransactions 681-kv-tran is pending; meaning, as an example, that thesecond packet 681-kv-tran-second-P has been recently placed in atransmission queue associated with the input-output medium 685.

In step 1042, as a result of the detection, the medium controller 685-mcstops handling of a first packet 686-tran-first-P associated with alower priority transactions 686-tran via the shared input-output medium685. In step 1043, the medium controller 685-mc commences transmissionof the second packet 681-kv-tran-second-P via said shared input-outputmedium 685, thereby preventing the lower priority transactions 686-tranfrom delaying the high priority key-value transaction 681-kv-tran.

In a first alternative to the method just described for mixing highpriority key-value transactions 681-kv-tran together with lower prioritytransactions 686-tran, further the prevention leads to a preservation oftiming performance of the high priority key-value transactions681-kv-tran, wherein such timing performance is selected from a groupconsisting of: (i) latency of the high priority key-value transactions681-kv-tran, and (ii) bandwidth of the high priority key-valuetransactions 681-kv-tran.

In a second alternative to the method described for mixing high prioritykey-value transactions 681-kv-tran together with lower prioritytransactions 686-tran, further the prevention leads to a preservation oflatency of the high priority key-value transactions 681-kv-tran, and asa result, such latency of the high priority key-value transactions681-kv-tran is shorter than a time required to transmit a shortestpacket belonging to said lower priority transactions 686-tran.

FIG. 14B illustrates one embodiment of a method for mixing high prioritykey-value transactions 681-kv-tran over a shared input-output medium685, together with lower priority transactions 686-tran over the sameshared input-output medium 685, without adversely affecting systemperformance. In step 1051, a medium controller 685-mc associated with ashared input-output medium 685 detects that a second packet681-kv-tran-second-P associated with high priority key-valuetransactions 681-kv-tran is pending. In step 1052, as a result of thedetection, the medium controller 685-mc delays handling of a firstpacket 686-tran-first-P associated with a lower priority transactions686-tran via the shared input-output medium 685. In step 1053, themedium controller 685-mc transmits the second packet681-kv-tran-second-P via said shared input-output medium 685, therebypreventing the lower priority transactions 686-tran from delaying thehigh priority key-value transaction 681-kv-tran.

In a first alternative to the method just described for mixing highpriority key-value transactions 681-kv-tran together with lower prioritytransactions 686-tran, further the prevention leads to a preservation oftiming performance of the high priority key-value transactions681-kv-tran, wherein such timing performance is selected from a groupconsisting of: (i) latency of the high priority key-value transactions681-kv-tran, and (ii) bandwidth of the high priority key-valuetransactions 681-kv-tran.

In a second alternative to the method described for mixing high prioritykey-value transactions 681-kv-tran together with lower prioritytransactions 686-tran, further the prevention leads to a preservation oflatency of the high priority key-value transactions 681-kv-tran, and asa result, such latency of the high priority key-value transactions681-kv-tran is shorter than a time required to transmit a shortestpacket belonging to lower priority transactions 686-tran.

FIG. 14C illustrates one embodiment of a method for reducing latencyassociated with key-value transactions 686-dv-tran involving adistributed data store interconnected by a network. In step 1061, afirst network-interface-card (NIC) 685-NIC receives, from a firstcompute element 600-c 1, a new request 600-req 2 from FIGS. 11B and 11Cto extract with high priority a first value 618-v 1 associated with afirst key 618-k 1. In step 1062, consequently the firstnetwork-interface-card 685-NIC delays a lower priority transaction686-tran or other network-related activity that prevents or that mightprevent, the first network-interface-card 685-NIC from immediatelycommunicating the first key 618-k 1 to a destination server 618 astoring the first value 618-v 1 and belonging to a key-value-store 621comprising a plurality of servers 618 a, 618 b, 618 c. In step 1063, asa result of such delaying, the first network-interface card 685-NICcommunicates immediately the first key 618-k 1 to the destination server618 a, thereby allowing the destination server 618 a to startimmediately processing of the first key 618-k 1 as required forlocating, within the destination server 618 a, the first value 618-v 1in conjunction with said new request 600-req 2. It is understood thatthe phrase “lower priority transaction 686-tran or other network-relatedactivity” includes the start of any lower priority transaction 686-tran,a specific packet in the middle of a lower priority transaction 686-tranwhich is delayed to allow communication of a high priority transaction681-kv-tran or of any packet associated with a high priority transaction681-kv-tran, and any other network activity that is not associated withthe high priority transaction 681-kv-tran and that could delay orotherwise impede the communication of a high priority transaction681-kv-tran or any packet associated with a high priority transaction681-kv-tran.

In one embodiment, said delaying comprises prioritizing the new request600-req 2 ahead of the lower priority transaction 686-tran or othernetwork-related activity, such that lower priority transaction 686-tranor other network related activity starts only after the communicating ofthe first key 618-k 1.

One embodiment is a system 680 (FIG. 13A) configured to facilitate lowlatency key-value transactions, including: a shared input-output medium685 associated with a medium controller 685-mc; acentral-processing-unit (CPU) 600-CPU; and a key-value-store 621comprising a first data interface 523-1 (FIG. 10B) and a first memorymodule 540-m 1 (FIG. 10B), said first data interface is configured tofind a first value 618-v 1 (FIG. 13A) in said first memory module andextract said first value from said first memory module using randomaccess read cycles, and said key-value-store 621 is communicativelyconnected with said central-processing-unit 600-CPU via said sharedinput-output medium 685. In one embodiment, the central-processing-unit600-CPU is configured to initiate a high priority key-value transaction681-kv-tran (FIG. 13A) in conjunction with said key-value-store 621, bysending to said key-value-store, via said shared input-output medium685, a new request 600-req 2 (FIG. 11C) for said first value 618-v 1,said new request comprising a first key 618-k 1 associated with saidfirst value and operative to facilitate said finding; and the mediumcontroller 685-mc is configured to block lower priority transactions686-tran via said shared input-output medium 685, thereby preventingsaid lower priority transactions from delaying said new request 600-req2, thereby allowing the system to minimize a time between said sendingof the new request to said extraction of the first value 618-v 1. In oneembodiment, said prevention of delay and said random access read cyclestogether result in said minimization, such that said time between saidsending of the new request 600-req 2 to said extraction of the firstvalue 618-v 1 is kept below 5 (five) microseconds. In one embodiment, asa result from said minimization, said high priority key-valuetransaction 681-kv-tran results in the delivery of said first value618-v 1 to said central-processing-unit 600-CPU in less than 10 (ten)microseconds from said initiation.

FIG. 15A illustrates one embodiment of a system 700 configured tocontrol random access memory in a shared memory pool 512. There is afirst server 618 a, which includes a first memory module 540-m 1, afirst data interface 523-1, and a second compute element 700-c 2. Thefirst memory module 540-m 1 includes various data sets which may berequested by a first compute element 600-c 1 located on a second server618 b. The first compute element 600-c 1 may request access 600-req 2 toa data set 703-D1 over a communication network 702 that is incommunicative contact with the first server 618 a, in which the requestis sent to the first data interface 523-1. Simultaneously: (i) the firstdata interface 523-1 performs a first random access read cycle 703-RD-D1in conjunction with the first memory module 540-m 1 to retrieve therequested first data set 703-D1, and (ii) the access controller 701determines if the first compute element 600-c 1 is authorized to haveaccess to the requested data set 703-D1, such that the determinationdoes not delay the first random access read cycle 703-RD-D1. If thefirst compute element 600-c 1 is authorized to access the first data set703-D1, then the first server 618 b will provide the requested data set703-D1 to the first compute element 600-c 1. If the first computeelement 600-c 1 is not authorized to receive the first data set 703-D1,then the access controller 701 will prevent delivery of the first dataset 703-D1.

In an alternative embodiment illustrated in FIG. 15A, a second computeelement 700-c 2 is co-located on the first server 618 a with the firstdata interface 523-1 and the first memory module 540-m 1. The secondcompute element 700-c 2 is in communicative contact with the first datainterface 523-1 via a local data bus 704, which could be, for example, aPCIE bus or Infiniband. The second compute element 700-c 2 requests700-req a second data set 703-D2 from the first memory module 540-m 1.The processing of the second request 700-req is similar to theprocessing of the request 600-req 2 from the first compute element 600-c1. This second request 700-req is sent to the first data interface523-1. Simultaneously: (i) the access controller 701 determines if thesecond compute element 700-c 2 is authorized to access the second dataset 703-D2, while (ii) the first data interface 523-1 in conjunctionwith the first memory module 540-m 1 perform a second random access readcycle 703-RD-D2 resulting in the retrieval of the second data set703-D2. If the access controller 701 determines that the second computeelement 700-c 2 is authorized to access the second data set 703-D2, thenthe second data set 703-D2 is sent to the second compute element 700-c 2over the local data bus 704. If the second compute element 700-c 2 isnot authorized to access the second data set 703-D2, then the accesscontroller 701 prevents delivery of the second data set 703-D2 to thesecond compute element 700-c 2.

In an alternative embodiment illustrated in FIG. 15A, a system isconfigured to allow or not allow a compute element to write a data setinto the shared memory pool. In one embodiment, a first compute element600-c 1 requests to write a third data set into a third address locatedwithin the first memory module 540-m 1. This third request is sent fromthe first compute element 600-c 1 over the communication network 702 tothe first data interface 523-1, and the third data set is thentemporarily stored in buffer 7TB. After the first compute element 600-c1 sends this third request, the first compute element 600-c 1 cancontinue doing other work without waiting for an immediate response tothe third request. If the access controller 701 determines that thefirst compute element 600-c 1 is authorized to write the third data setinto the third address, then the first data interface 523-1 may copy thethird data set into the third address within the first memory module540-m 1. If the first compute element is not authorized to write intothe third address, then the access controller 701 will prevent thecopying of the third data set into the third address within the firstmemory module 540-m 1.

In an alternative to the alternative embodiment just described, therequesting compute element is not the first compute element 600-c 1 butrather the second compute element 700-c 2, in which case the thirdrequest is conveyed by the local data bus 704, and the rest of theprocess is essentially as described above, all with the second computeelement 700-c 2 rather than the first compute element 600-c 1.

In the various embodiments illustrated in FIG. 15A, differentpermutations are possible. For example, if a particular compute element,be it the first 600-c 1 or the second 700-c 2 or another computeelement, makes multiple requests, all of which are rejected by theaccess controller 701 due to lack of authorization, that compute elementmay be barred from accessing a particular memory module, or barred evenfrom accessing any data set in the system.

FIG. 15B illustrates one embodiment of a sub-system with an accesscontroller 701 that includes a secured configuration 701-sec which maybe updated by a reliable source 701-source. This is a sub-system of theentire system 700. Access controller 701 is implemented as a hardwareelement having a secured configuration function 701-sec operative to setthe access controller into a state in which a particular compute element(600-c 1, or 700-c 2, or another) is authorized to access some data setlocated in first memory module 540-m 1, but a different compute element(600-c 1, or 700-c 2, or another) is not authorized to access the samedata set. The rules of authorization are located within a securedconfiguration 701-sec which is part of the access controller 701. Theserules are created and controlled by a reliable source 701-source that isnot related to any of the particular compute elements. The lack ofrelationship to the compute elements means that the compute elementscannot create, delete, or alter any access rule or state of access,thereby assuring that no compute element can gain access to a data setto which it is not authorized. FIG. 15B shows a particular embodiment inwhich the reliable source 701-source is located apart from the accesscontroller, and thereby controls the secured configuration 701-secremotely. In alternative embodiments, the reliable source 701-source maybe located within the access controller 701, but in all cases thereliable source 701-source lacks a relationship to the compute elements.

The communicative connection between the reliable source 701-source andthe secured configuration 701-sec is any kind of communication link,while encryption and/or authentication techniques are employed in orderto facilitate said secure configuration.

FIG. 15C illustrates one alternative embodiment of a system operative tocontrol random memory access in a shared memory pool. Many of theelements described with respect to FIGS. 15A and 15B. appear here also,but in a slightly different configuration. There is a motherboard 700-MBwhich includes the second compute element 700-c 2, the first datainterface 523-1, and the shared memory pool 512, but these structuralelements do not all reside on a single module within the motherboard700-MB. The first memory module 540-m 1, and the first data interface523-1, including the access controller 701, are co-located on one module700-module which is placed on the motherboard 700-MB. The second computeelement 700-c 2, which still makes requests 700-req over the local databus 704, is not co-located on module 700-module, but rather is incontact with module 700-module through a first connection 700-con-1which is connected to a first slot 700-SL in the motherboard. In FIG.15C, the first compute element 600-c 1 still makes requests 600-req 2over a communication network 702 that is connected to the motherboard700-MB through a second connection 700-con-2, which might be, forexample, and Ethernet connector. In the particular embodimentillustrated in FIG. 15C, there is a reliable source 701-source thatcontrols authorizations of compute elements to access data sets, suchreliable source 701-source is located outside the motherboard 700-MB,and the particular connection between the reliable source 701-source andthe motherboard 700-MB is the communication network 702 which is sharedwith the first compute element 600-c 1. This is only one possibleembodiment, and in other embodiments, the reliable source 701-sourcedoes not share the communication network 702 with the first computeelement 600-c 1, but rather has its own communication connection withthe motherboard 700-MB. In some embodiments, the length of the localdata bus 704 is on the order of a few centimeters, whereas the length ofthe communication network 702 is on the order of a few meters to tens ofmeters.

One embodiment is a system 700 operative to control random memory accessin a shared memory pool, including a first data interface 523-1associated with a first memory module 540-m 1 belonging to a sharedmemory pool 512, an access controller 701 associated with the first datainterface 523-1 and with the first memory module 540-m 1, and a firstcompute element 600-c 1 connected with the first data interface 523-1via a communication network 702, whereas the first memory module 540-m 1is an external memory element relative to the first compute element600-c 1. That is to say, there is not a direct connection between thefirst compute element 600-c 1 and the first memory module 540-m 1 (e.g.the two are placed on different servers). Further, the first datainterface 523-1 is configured to receive, via the communication network702, a new request 600-req 2 from the first compute element 600-c 1 toaccess a first set of data 703-D1 currently stored in the first memorymodule 540-m 1. Further, the first data interface 523-1 is furtherconfigured to retrieve the first set of data 703-D1, as a response tothe new request 600-req 2, by performing at least a first random accessread cycle 703-RD-D1 in conjunction with the first memory module 540-m1. Further, the access controller 701 is configured to prevent deliveryof said first set of data 703-D1 to said first compute element 600-c 1when determining that said first compute element is not authorized toaccess the first set of data, but such that the retrieval is allowed tostart anyway, thereby preventing the determination from delaying theretrieval when the first compute element is authorized to access thefirst set of data.

In one embodiment, said retrieval is relatively a low latency processdue to the read cycle 703-RD-D1 being a random access read cycle thatdoes not require sequential access. In one embodiment, the retrieval,which is a relatively low latency process, comprises the random accessread cycle 703-RD-D1, and the retrieval is therefore executed entirelyover a period of between 10 nanoseconds and 1000 nanoseconds, therebymaking said retrieval highly sensitive to even relatively short delaysof between 10 nanoseconds and 1000 nanoseconds associated with saiddetermination, thereby requiring said retrieval to start regardless ofsaid determination process.

In one alternative embodiment to the system 700 operative to controlrandom memory access in a shared memory pool 512, the system includesfurther a second compute element 700-c 2 associated with the firstmemory module 540-m 1, whereas the first memory module is a local memoryelement relative to the second compute element. The system 700 includesfurther a local data bus 704 operative to communicatively connect thesecond compute element 700-c 2 with the first data interface 523-1.Further, the first data interface 523-1 is configured to receive, viathe local data bus 704, a second request 700-req from the second computeelement 700-c 2 to access a second set of data 703-D2 currently storedin the first memory module 540-m 1. Further, the first data interface523-1 is configured to retrieve the second set of data 703-D2, as aresponse to said second request 700-req, by performing at least a secondrandom access read cycle 703-RD-D2 in conjunction with the first memorymodule 540-m 1. Further, the access controller 701 is configured toprevent delivery of the second set of data 703-D2 to the second computeelement 700-c 2 after determining that the second compute element in notauthorized to access the second set of data.

In one possible configuration of the alternative embodiment describedabove, further the access controller 701 is implemented as a hardwareelement having a secured configuration function 701-sec operative to setthe access controller into a state in which the second compute element700-c 2 is not authorized to access the second data set 703-D2. Further,the secured configuration function 701-sec is controllable only by areliable source 701-source that is not related to the second computeelement 700-c 2, thereby preventing the second compute element 700-c 2from altering the state, thereby assuring that the second computeelement does not gain access to the second data set 703-D2.

In a second possible configuration of the alternative embodimentdescribed above, further the second compute element 700-c 2, the firstdata interface 523-1, the access controller 701, and the first memorymodule 540-m 1 are placed inside a first server 618 a. Further, thefirst compute element 600-c 1 is placed inside a second server 618 b,which is communicatively connected with the first server 618 a via thecommunication network 702.

In one variation of the second possible configuration described above,further the first data interface 523-1, the access controller 701, andthe first memory module 540-m 1 are packed as a first module 700-moduleinside the first server 618 a

In one option of the variation described above, further the secondcompute element 700-c 2 is placed on a first motherboard 700-MB.Further, the first module 700-module has a form factor of a card, and isconnected to the first motherboard 700-MB via a first slot 700-SL in thefirst motherboard.

In a second alternative embodiment to the system 700 operative tocontrol random memory access in a shared memory pool 512, further theretrieval is performed prior to the prevention, such that the retrievalis performed simultaneously with the determination, thereby avoidingdelays in the retrieval. Further, the prevention is achieved by blockingthe first set of data 703-D1 retrieved from reaching the first computeelement 600-c 1.

In a third alternative embodiment to the system 700 operative to controlrandom memory access in a shared memory pool 512, further the preventionis achieved by interfering with the retrieval after the determination,thereby causing the retrieval to fail.

In a fourth alternative embodiment to the system 700 operative tocontrol random memory access in a shared memory pool 512, further theshared memory pool is a key-value store, the first data set 703-D1 is afirst value 618-v 1 (FIG. 13A) associated with a first key 618-k 1, thefirst key 618-k 1 is conveyed by said new request 600-req 2, and theretrieval comprises finding the first value 618-v 1 in the first memorymodule 540-m 1 using the first key 618-k 1 conveyed, prior to theperforming of the first random access read cycle 703-RD-D1.

In one possible configuration of the fourth alternative embodimentdescribed above, further the authorization is managed by a reliablesource 701-source at the key-value store level, such that the firstcompute element 600-c 1 is authorized to access a first plurality ofvalues associated respectively with a first plurality of keys, and suchthat the first compute element is not authorized to access a secondplurality of values associated respectively with a second plurality ofkeys, wherein the first value 618-v 1 belongs to said second pluralityof values.

In a fifth alternative embodiment to the system 700 operative to controlrandom memory access in a shared memory pool 512, further the firstmemory module 540-m 1 is based on a random-access-memory (RAM), thefirst data set 703-D1 is located in a first address associated with therandom-access-memory, and the first address is conveyed by the newrequest 600-req 2.

In one possible configuration of the fifth alternative embodimentdescribed above, further the authorization is managed by a reliablesource 701-source at the random-access-memory address level, such thatthe first compute element 600-c 1 is authorized to access a first rangeof addresses, and such that the first compute element is not authorizedto access a second range of addresses, wherein the first data set 703-D1has an address that is within the second range of addresses. In someembodiments, the random-access-memory (RAM) is DRAM. In someembodiments, random-access-memory (RAM), is Flash memory.

One embodiment is a system 700 operative to control random memory accessin a shared memory pool 512, including a first data interface 523-1associated with a first memory module 540-m 1 belonging to a sharedmemory pool 512, an access controller 701 and a temporary write buffer7TB associated with the first data interface 523-1 and the first memorymodule 540-m 1, and a first compute element 600-c 1 connected with thefirst data interface 523-1 via a communication network 702 whereas thefirst memory module 540-m 1 is a memory element that is externalrelative to the first compute element. Further, the first data interface523-1 is configured to receive, via the communication network 702, athird request from the first compute element 600-c 1 to perform a randomwrite cycle for a third set of data into a third address within thefirst memory module 540-m 1. Further, the first data interface 523-1 isconfigured to temporarily store the third set of data and third addressin the temporary write buffer 7TB, as a response to the third request,thereby allowing the first compute element 600-c 1 to assume that thethird set of data is now successfully stored in the first memory module540-m 1. Further, the first data interface 523-1 is configured to copythe third set of data from the temporary write buffer 7TB into the thirdaddress within the first memory module 540-m 1, using at least onerandom access write cycle, but only after said access controller 701determining that the first compute element 600-c 1 is authorized towrite into the third address.

One embodiment is a system 700-module operative to control data accessin a shared memory pool 512, including a first memory module 540-m 1belonging to a shared memory pool 512, configured to store a first703-D1 and a second 703-D2 set of data. The system includes also a firstdata interface 523-1 associated with the first memory module 540-m 1,and having access to (i) a first connection 700-con-1 with a local databus 704 of a second system 700-MB, and to (ii) a second connection700-con-2 with a communication network 702. The system includes also anaccess controller 701 associated with the first data interface 523-1 andthe first memory module 540-m 1. Further, the first data interface 523-1is configured to facilitate a first memory transaction associated withthe first set of data 703-D1, via the communication network 702, betweena first compute element 600-c 1 and the first memory module 540-m 1.Further, the first data interface 523-1 is configured to facilitate asecond memory transaction associated with the second set of data 703-D2,via the local data bus 704, between a second compute element 700-c 2belonging to the second system 700-MB and the first memory module 540-m1. Further, the access controller 701 is configured to prevent thesecond compute element 700-c 2 from performing a third memorytransaction via the local data bus 704 in conjunction with the first setof data 703-D1, by causing the first data interface 523-1 to notfacilitate the third memory transaction.

In an alternative embodiment to the system 700-module operative tocontrol data access in a shared memory pool 512, further the secondsystem 700-MB is a motherboard having a first slot 700-SL, and the firstconnection 700-con-1 is a connector operative to connect with said firstslot.

In one possible configuration of the alternative embodiment justdescribed, further the first local bus 704 is selected from a group ofinterconnects consisting of: (i)peripheral-component-interconnect-express (PCIE) computer expansion bus,(ii) Ethernet, and (iii) Infiniband.

In a second alternative embodiment to the system 700-module operative tocontrol data access in a shared memory pool 512, further thecommunication network 702 is based on Ethernet, and the secondconnection 700-con-2 in an Ethernet connector. In one embodiment, system700-module is a network interface card (NIC).

FIG. 16A illustrates one embodiment of a method for determiningauthorization to retrieve a first value 681-v 1 in a key-value store 621while preserving low latency associated with random-access retrieval. Instep 1071, a first data interface 523-1 receives a new request 600-req 2from a first compute element 600-c 1 to access a first value 618-v 1(FIG. 13A) currently stored in a first memory module 540-m 1 associatedwith the first data interface, wherein the first memory module belongsto a key-value store 621 (FIG. 13A), and the first value is associatedwith a first key 618-k 1 that is conveyed by the new request 600-req 2.In step 1072, a determination process is started in which an accesscontroller 701 associated with the first data interface 523-1 determineswhether or not the first compute element 600-c 1 is authorized to accessthe first value. In step 1073, using the first key 618-k 1, the firstdata interface 523-1 finds in the memory module 540-m 1 a first locationthat stores the first value 618-v 1, and this finding occurssimultaneously with the determination process described in step 1072. Instep 1074, the first data interface 523-1 performs a first random accessread cycle 703-RD-D1 in conjunction with the first memory module 540-m1, thereby retrieving the first value 618-v 1, and this cycle isperformed simultaneously with the determination process described instep 1072. In step 1075, the access controller 701 finishes thedetermination process. In step 1076, when the determination processresults in a conclusion that the first compute element 600-c 1 is notauthorized to access the first value 618-v 1, the access controller 701prevents delivery of the first value 618-v 1 retrieved for the firstcompute element 600-c 1. In some embodiments, the finding in step 1073and the performing in step 1074 are associated with random-accessactions done in conjunction with the first memory module 540-m 1, andthe result is that the retrieval has a low latency, which means that thesimultaneity of steps 1073 and 1074 with the determination processfacilitates a preservation of such low latency.

In an alternative embodiment to the method just described fordetermining authorization to retrieve a first value 618-v 1 in akey-value store 621 while preserving low latency associated withrandom-access retrieval, further when the determination process resultsin a conclusion that the first compute element 600-c 1 is authorized toaccess said value 618-v 1, the access controller 701 allows delivery ofthe retrieved value 618-v 1 to the first compute element 600-c 1.

FIG. 16B illustrates one embodiment of a method for determiningauthorization to retrieve a first value 618-v 1 in a key-value store 621while preserving low latency associated with random-access retrieval. Instep 1081, a first data interface 523-1 receives a new request 600-req 2from a first compute element 600-c 1 to access a first value 618-v 1(FIG. 13A) currently stored in a first memory module 540-m 1 associatedwith the first data interface, wherein the first memory module belongsto a key-value store 621 (FIG. 13A), and the first value is associatedwith a first key 618-k 1 that is conveyed by the new request 600-req 2.In step 1082, a determination process is started in which an accesscontroller 701 associated with the first data interface 523-1 determineswhether or not the first compute element 600-c 1 is authorized to accessthe first value. In step 1083, using a the first key 618-k 1, the firstdata interface 523-1 starts a retrieval process that includes (i)finding in the first memory module 540-m 1 a first location that storesthe first value 618-v 1, and (ii) performing a first random access readcycle 703-RD-D1 at the first location to obtain the first value 618-v 1,such that the retrieval process occur simultaneously with thedetermination process performed by the access controller 701. In step1084, the access controller finishes the determination process. In step1085, when the determination process results in a conclusion that thefirst compute element 600-c 1 is not authorized to access the firstvalue 618-v 1, the access controller 701 interferes with the retrievalprocess, thereby causing the retrieval process to fail, therebypreventing delivery of the first value 618-v 1 to the first computeelement 600-c 1.

FIG. 17A illustrates one embodiment of a system 720 operative todistributively process a plurality of data sets 712-D1, 712-D2, 712-D3,712-D4, 712-D5, 712-D6 stored on a plurality of memory modules 540-m 1,540-m 2, 540-mk. In this system 720, a plurality of compute elements700-c 1, 700-c 2, 700-cn send requests for data to one or more datainterfaces 523-1, 523-2, 523-k. Data is held in data sets which arelocated in memory modules 540-m 1, 540-m 2, 540-mk, which togethercomprise a shared memory pool 512. Each data interface is associatedwith one or more memory modules 540-m 1, 540-m 2, 540-mk. As an example,data interface 523-1 is associated with memory module 540-m 1. In theembodiment shown in FIG. 17A, each data registry 723-R1, 723-R2, 723-Rkis associated with one of the data interfaces. Each memory moduleincludes one or more data sets. In the embodiment shown, memory module540-m 1 includes data sets 712-D1, 712-D2, memory module 540-m 2includes data sets 712-D3, 712-D4, and memory module 540-mk includesdata sets 712-D5, 712-D6. It is understood that a memory module mayinclude one, or two, or any other number of data sets. It is understoodthat the shared memory pool 512 may include two, three, or any otherplurality number of memory modules. It is understood that the system mayinclude one, two, or any other number of data interfaces, and one, two,or any other number of compute elements. Various functions of each datainterface may be: to know the location of each data set included withinan associated memory module, to receive requests for data from computeelements, to extract from the associated memory modules data sets, tosend as responses to the compute elements the data sets, and to keeptrack of which data sets have already been served to the computeelements. Within each data registry is an internal registry whichfacilitates identification of which data sets have not yet been served,facilitates keeping track of data sets which have been served, and mayfacilitate the ordering by which data sets that have not yet been servedto the compute elements will be served. In FIG. 17A, data interface523-1 includes internal registry 723-R1, data interface 523-2 includinginternal registry 723-R2, and data interface 523-k includes internalregistry 523-Rk.

In an embodiment alternative to the embodiment shown in FIG. 17A, theinternal registries 723-R1, 723-R2, and 723-Rk, are not part of datainterfaces. Rather, there is a separate module between the datainterfaces 523-1, 523-2, 523-k, and the memory modules 540-m 1, 540-m 2,540-mk. This separate module includes one or more internal registries,and the functions of the internal registries, as described above, areimplemented in this separate module rather than in the data interfacesillustrated in FIG. 17A.

FIG. 17B illustrates one embodiment of a system in which a plurality ofcompute elements 700-c 1, 700-c 2 send data requests 7DR1, 7DR2 to asingle data interface 523-1 which then accesses multiple data sets712-D1, 712-D2 stored in a single memory module 540-m 1. In variousembodiments, any number of compute elements may send data requests toany number of data interfaces. In the particular embodiment illustratedin FIG. 17B, a plurality of compute elements 700-c 1, 700-c 2 send theirrequests to a single data interface 523-1. It is understood that threeor any higher number of compute elements may send their requests tosingle data interface 523-1. FIG. 17B shows only one memory module 540-m1 associated with data interface 523-1, but two or any other number ofmemory modules may be associated with data interface 523-1. FIG. 17Bshows two data sets 712-D1, 712-D2 included within memory module 540-m1, but there may be three or any other higher number of included datasets. FIG. 17B shows two data requests 7DR1, 7DR2, but there may bethree or any other number of data requests send by the compute elements.

FIG. 17C illustrates one embodiment of a system in which a single datainterface 523-1 extracts from a single memory module 540-m 1 some datasets and sends those data sets as multiple responses 7SR1, 7SR2 to thecorrect compute element. In this sense, a “correct” compute elementmeans that the compute element which requested data set receives a dataset selected for it by the data interface. FIG. 17C is correlative toFIG. 17B. After data interface 523-1 has received the data requests, thedata interface 523-1 sends 7SR1 the first data set 712-D1, as a responseto request 7DR1, to compute element 700-c 1, and the data interface523-1 sends 7SR2 the second data set 712-D2, as a response to request7DR2, to compute element 700-c 2. It is noted that data interface 523-1sends data set 712-D2 as a response to request 7DR2 only afterconcluding, based on sending history as recorded in 723-R1, that dataset 712-D2 was not served before.

FIG. 17D illustrates one embodiment of the system in which a singlecompute element 700-c 1 sends a plurality of data requests 7DR1, 7DR3 toa plurality of data interfaces 523-1, 523-2 in which each data interfacethen accesses data sets stored in an associated memory module. Computeelement 700-c 1 sends data request 7DR1 to data interface 523-1, whichthen accesses associated memory module 540-m 1 containing data sets712-D1 and 712-D2. Compute element 700-c 1 also sends data request 7DR3to data interface 523-2, which then accesses associated memory module540-m 2 containing data sets 712-D3 and 712-D4. These two requests 7DR1and 7DR3 may be sent essentially simultaneously, or with a time lagbetween the earlier and the later requests. It is understood thatcompute element 700-c 1 may send data requests to three or even moredata interfaces, although FIG. 17D shows only two data requests. It isunderstood that either or both of the data interfaces may have one, two,or more associated memory modules, although FIG. 17D shows only onememory module for each data interface. It is understood that any memorymodule may have more than two data sets, although FIG. 17D shows exactlytwo data sets per memory module.

FIG. 17E illustrates one embodiment of the system in which a singlecompute element 700-c 1 receives responses to data requests that thecompute element 700-c 1 sent to a plurality of data interfaces 523-1,523-2, in which each data interface accesses an associated memory moduleand sends the accessed data to the compute element 700-c 1. FIG. 17E iscorrelative to FIG. 17D. Data interface 523-1, as a response to request7DR1, selects data set 712-D1 since it was not served yet, extracts dataset 712-D1 from memory module 540-m 1, and serves 7SR1 data set 712-D1to compute element 700-c 1. Data interface 523-2, as a response torequest 7DR3, selects data set 712-D3 since it was not served yet,extracts data set 712-D3 from memory module 540-m 2, and serves 7SR3data set 712-D3 to compute element 700-c 1. The two responses 7DR1 and7DR2 may be sent essentially simultaneously, or with a time lag betweenthe earlier and the later. It is noted that data interface 523-2 sendsdata set 712-D3 as a response to request 7DR3 only after concluding,based on sending history as recorded in 723-R2, that data set 712-D3 wasnot served before. After serving data set 712-D3, data interface 523-2may record that fact in 723-R2, and therefore may guarantee that dataset 712-D3 is not served again as a result of future requests made byany of the compute elements.

One embodiment is a system 720 that is operative to distributivelyprocess a plurality of data sets stored on a plurality of memorymodules. One particular form of such embodiment includes a plurality ofcompute elements 700-c 1, 700-c 2, 700-cn, a shared memory pool 512 witha plurality of memory modules 540-m 1, 540-m 2, 540-mk configured todistributively store a plurality of data sets 712-D1, 712-D2, 712-D3,712-D4, 712-D5, 712-D6, and a plurality of data interfaces 523-1, 523-2,523-k associated respectively with the plurality of memory modules 540-m1, 540-m 2, 540-mk. Further, each of the data interfaces is configuredto:

(i) receive data requests 7DR1, 7DR2 from any one of the plurality ofcompute elements, such as 7DR1 from 700-c 1, or 7DR2 from 700-c 2;

(ii) identify from the data sets 712-D1, 712-D2 of the memory module540-m 1 the data sets 712-D1, 712-D2 that were not served yet;

(iii) serve 7SR1, 7SR2, as replies to the data requests 7DR1, 7DR2,respectively, the data sets identified 712-D1, 712-D2, respectively; and

(iv) keep track of the data sets already served, such that, as anexample, after responding with 712-D1 to data request 7DR1, datainterface 523-1 keeps a record of the fact that 712-D1 was just served,and therefore data interface 523-1 knows not to respond again with712-D1 to another data request such as 7DR2, but rather to respond with712-D2 to data request 7DR2, since 712-D2 has not yet been served.Further, each of the plurality of compute elements is configured to:(i) send some of the data requests 7DR1, 7DR3 to at least some of theplurality of data interfaces 523-1, 523-2 respectively;(ii) receive respectively some of the replies 7SR1, 7SR3 comprising someof the data sets 712-D1, 712-D3 respectively; and(iii) process the data sets received,Further, the compute elements continue to send data requests, receivereplies, and process data, until a first condition is met. For example,one condition might be that all of the data sets that are part of thedata corpus are served and processed.

In one alternative embodiment to the system just described, further thedata requests 7DR1, 7DR2, 7DR3 do not specify certain which of theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6should be served to the compute elements 700-c 1, 700-c 2. Rather, theidentification and the keeping track constitute the only way by whichthe plurality of data interfaces 523-1, 523-2, 523-k know which one ofthe plurality of data sets is to be specifically served to the specificcompute element making the data request, and thereby identification andkeeping track constitute the only way by which the system 720 insuresthat none of the data sets is served more than once. As a non-limitingexample, when sending data request 7DR1, compute element 700-c 1 doesnot specify in the request that data set 712-D1 is to be served as aresponse. The decision to send data set 712-D1 as a response to datarequest 7DR1 is made independently by data interface 523-1 based onrecords kept indicating that data set 712-D1 was not yet served. Therecords may be kept within the internal register 723-R1 of datainterface 523-1.

In one possible configuration of the alternative embodiment justdescried, further the plurality of compute elements 700-c 1, 700-c 2,700-cn comprises a first compute element 700-c 1 and a second computeelement 700-c 2, the plurality of data interfaces 523-1, 523-2, 523-kcomprises a first data interface 523-1 including a first internalregistry 723-R1 that is configured to facilitate the identification andthe keeping track, and the plurality of memory modules 540-m 1, 540-m 2,540-mk comprises a first memory module 540-m 1 associated with the firstdata interface 523-1 and configured to store a first data set 712-D1 anda second data set 712-D2. Further, the first compute element 700-c 1 isconfigured to send a first data request 7DR1 to the first data interface523-1, and the first data interface is configured to (i) conclude,according to the first internal registry 723-R1, that the first data set712-D1 is next for processing from the ones of the data sets 712-D1,712-D2 stored in the first memory module 540-m 1, (ii) extract the firstdata set 712-D1 from the first memory module 540-m 1, (iii) serve 7SR1the first data set 712-D1 extracted to the first compute element 700-c1, and (iv) update the first internal registry 723-R1 to reflect saidserving of the first data set. Further, the second compute element 700-c2 is configured to send a second data request 7DR2 to the first datainterface 523-1, and the first data interface is configured to (i)conclude, according to the first internal registry 723-R1, that thesecond data set 712-D2 is next for processing from the ones of the datasets 712-D1, 712-D2 stored in the first memory module 540-m 1, (ii)extract the second data set 712-D2 from the first memory module 540-m 1,(iii) serve the second data set 712-D2 extracted to the second computeelement 700-c 2, and (iv) update the first internal registry 723-R1 toreflect said serving of the second data set.

In one possible variation of the configuration just described, furtherthe plurality of data interfaces 523-1, 523-2, 523-k comprises a seconddata interface 523-2 including a second internal registry 723-R2 that isconfigured to facilitate the identification and the keeping track, andthe plurality of memory modules 540-m 1, 540-m 2, 540-mk comprises asecond memory module 540-m 2 associated with said second data interface523-2 and configured to store a third data set 712-D3 and a fourth dataset 712-D4. Further, the first compute element 700-c 1 is configured tosend a third data request 7RD3 to the second data interface 523-2, andthe second data interface is configured to (i) conclude, according tothe second internal registry 723-R2, that the third data set 712-D3 isnext for processing from the ones of the data sets 712-D3, 712-D4 storedin the second memory module 540-m 2, (ii) extract the third data set712-D3 from the second memory module 540-m 2, (iii) serve the third dataset 712-D3 extracted to the first compute element 700-c 1, and (iv)update the second internal registry 723-R2 to reflect said serving ofthe third data set. Further, the second compute element 700-c 2 isconfigured to send a fourth of said data requests to the second datainterface 523-2, and the second data interface is configured to (i)conclude, according to the second internal registry 723-R2, that thefourth data set 712-D4 is next for processing from the ones of the datasets 712-D3, 712-D4 stored in the second memory module 540-m 2, (iii)extract the fourth data set 712-D4 from the second memory module 540-m2, (iii) serve the fourth data set 712-D4 extracted to the secondcompute element 700-c 2, and (iv) update the second internal registry723-R2 to reflect said serving of the fourth data set.

In a second alternative embodiment to the system described to beoperative to distributively process a plurality of data sets stored on aplurality of memory modules, further the plurality of compute elements700-c 1, 700-c 2, 700-cn are configured to execute distributively afirst task associated with the plurality of data sets 712-D1, 712-D2,712-D3, 712-D4, 712-D5, 712-D6 by performing the processing of the datasets received.

In one possible configuration of the second alternative embodiment justdescribed, further the execution of the first task can be done in anyorder of the processing of plurality of data sets, such that any one ofthe plurality of data sets can be processed before or after any other ofthe plurality of data sets. In other words, there is flexibility in theorder in which data sets may be processed.

In one possible variation of the configuration just described, furtherthe plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5,712-D6 constitute a first data corpus, and the first task is selectedfrom a group consisting of: (i) counting number of occurrences ofspecific items in the first data corpus, (ii) determining size of thedata corpus, (iii) calculating a mathematical property for each of thedata sets, and (iv) running a mathematical filtering process on each ofthe data sets.

In a third alternative embodiment to the system described to beoperative to distributively process a plurality of data sets stored on aplurality of memory modules, further each of the compute elements 700-c1, 700-c 2, 700-cn is configured, per each of the sending of one of thedata requests made by such compute element, to select one of theplurality of data interfaces as a target of receiving such data request,wherein the selection is done using a first technique. As a non-limitingexample, compute element 700-c 1 chooses to send data request 7DR1 todata interface 523-1, and then chooses to send data request 7DR3 to datainterface 523-2, but compute element 700-c 1 could have, instead, chosento send data request 7DR3 to data interface 523-k, and in that eventcompute element 700-c 1 would have received a different data set, suchas data set 712-D5, as a response to data request 7DR3.

In one possible configuration of the third alternative embodiment justdescribed, further the first technique is round robin selection.

In one possible configuration of the third alternative embodiment justdescribed, further the first technique is pseudo-random selection.

In one possible configuration of the third alternative embodiment justdescribed, further the selection is unrelated and independent of theidentification and the keeping track.

In a fourth alternative embodiment to the system described to beoperative to distributively process a plurality of data sets stored on aplurality of memory modules, further the keeping track of the data setsalready served facilitates a result in which none of the data sets isserved more than once.

In a fifth alternative embodiment to the system described to beoperative to distributively process a plurality of data sets stored on aplurality of memory modules, further the first condition is a conditionin which the plurality of data sets is served and processed in itsentirety.

FIG. 18 illustrates one embodiment of a method for storing and sendingdata sets in conjunction with a plurality of memory modules. In step1091, a system is configured in an initial state in which a plurality ofdata sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 belonging to afirst data corpus are stored among a plurality of memory modules 540-m1, 540-m 2, 540-mk, and such memory modules are associated,respectively, with a plurality of data interfaces 523-1, 523-2, 523-k,such that each of the plurality of data sets is stored only once in onlyone of the plurality of memory modules. In step 1092, each of the datainterfaces 523-1, 523-2, 523-k, respectively, keeps a record 723-R1,723-R2, 723-Rk about (i) which of the plurality of data sets are storedin the respective memory modules associated with the various datainterfaces and (ii) which of the various data sets were served by thedata interface to any one of the compute elements 700-c 1, 700-c 2,700-cn. In step 1093, each of the data interfaces, 523-1, 523-2, 523-k,receives data request such as 7DR1, 7DR2, 7DR3, from any one of theplurality of compute elements 700-c 1, 700-c 2, 700-cn. In step 1094,each of the data interfaces selects and serves, as a response to each ofthe data requests received by that data interface, one of the data sets,wherein the data set selected is stored in a memory module associatedwith that data interface, and wherein the data interface knows andguarantees that the data set served as a response was not previouslyserved by the data interface since the start of the initial state. Forexample, data interface 523-1 might serve, as a response to receivingdata request 7DR1, one data set such as 712-D1, where that data set isstored in a memory module 540-m 1 associated with data set 523-1, andthe selection of that data set 712-D1 is based on the record 723-R1 keptby the data interface 523-1 which indicates that this data set 712-D1has not been previously sent as a response since the start of theinitial state. In some embodiments, eventually all of the data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6, are serveddistributively to the plurality of compute elements 700-c 1, 700-c 2,700-cn, thereby allowing the plurality of compute elements todistributively process the entire first data corpus.

In one alternative embodiment to the method just described, further theplurality of data sets is a plurality of values associated with arespective plurality of keys, and the data requests are requests for thevalues associated with the keys. For example, a plurality of values,618-v 1, 618-v 2, 618-v 3 (all from FIG. 13A), may be associatedrespectively with a plurality of keys, e.g. 618-k 1, 618-k 2, 618-k 3(all from FIG. 13A), and the data requests are requests for the valuesassociated with the keys.

In one possible configuration of the alternative embodiment justdescribed, the plurality of compute elements 700-c 1, 700-c 2, 700-cn,do not need to keep track of which values have already been servedbecause a record of served values is already kept by each datainterface. Therefore, the requests do not need to specify specific keysor values, because the data interfaces already know which keys andvalues can still be served to the plurality of compute elements.

FIG. 19A illustrates one embodiment of a system 740 operative to achieveload balancing among a plurality of compute elements 700-c 1, 700-c 2,700-cn, accessing a shared memory pool 512. The system 740 includes afirst data interface 523-G that is communicatively connected to both thecompute elements 700-c 1, 700-c 2, 700-cn and the shared memory pool512. The shared memory pool 512 includes a plurality of data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 which comprise a datacorpus related to a particular task to be processed by the computeelements 700-c 1, 700-c 2, 700-cn. The data sets 712-D1, 712-D2, 712-D3,712-D4, 712-D5, 712-D6 may be stored in the shared memory pool 512 inany manner, including individually as shown in FIG. 19A, or withinvarious memory modules not shown in FIG. 19A, or in a combination inwhich some of the various data sets are stored individually while othersare stored in memory modules. Upon receiving requests from the computeelements 700-c 1, 700-c 2, 700-cn for data sets related to a particulartask being processed by the compute elements 700-c 1, 700-c 2, 700-cn,the first data interface 523-G extracts the data sets 712-D1, 712-D2,712-D3, 712-D4, 712-D5, 712-D6 from the shared memory pool 512 andserves them to the compute elements 700-c 1, 700-c 2, 700-cn. The rateat which the first data interface 523-G extracts and serves data sets toa particular compute element is proportional to the rate at which thatcompute elements requests to receive data sets, and each compute elementmay request data sets as the compute element finishes processing of anearlier data set and becomes available to receive and process additionaldata sets. Thus, the first data interface 523-G, by extracting andserving data sets in response to specific data requests, helps achieve aload balancing of processing among the various compute elements 700-c 1,700-c 2, 700-cn, such that there is a balance between available capacityfor processing and the receipt of data sets to be processed, such thatutilization of system capacity for processing is increased. The firstdata interface 523-G includes an internal registry 723-RG that isconfigured to keep track of which of the data sets 712-D1, 712-D2,712-D3, 712-D4, 712-D5, 712-D6 have been extracted from the shared pool512 and served to the compute elements 700-c 1, 700-c 2, 700-cn. Thefirst data interface 523-G may extract and serve each of the data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 exactly once, therebyinsuring that no data set is processed multiple times.

FIG. 19B illustrates one embodiment of a system 740 including multiplecompute elements 700-c 1, 700-c 2 and a first data interface 523-G, inwhich the system 740 is operative achieve load balancing by serving datasets to the compute elements 700-c 1, 700-c 2 proportional to the rateat which the compute elements 700-c 1, 700-c 2 request data sets forprocessing. As it becomes or is about to become available to processadditional data sets, the first compute element 700-c 1 sends a firstdata request 8DR1 to the first data interface 523-G. The first datainterface 523-G concludes, based on information in the internal registry723-RG, that a first data set 712-D1 is the next for processing, so thefirst data interface 523-G extracts 700-f 1 the first data set 712-D1from the shared memory 512, serves 8SR1 the first data set 712-D1 to thefirst compute element 700-c 1, and updates the internal registry 723-RGto reflect the serving of the first data set. The first compute element700-c 1 continues to perform processing 701-p 1 of data sets related tothe task, here by processing the first data set received in response8SR1. As it becomes available or is about to become available to processadditional data sets, the second compute element 700-c 2 sends a seconddata request 8DR2 to the first data interface 523-G. The first datainterface 523-G concludes, based on information in the internal registry723-RG, that the first data set has already been served to one of thecompute elements but a second data set is the next for processing, sothe first data interface 523-G extracts 700-f 2 the second data set712-D2 from the shared memory 512, serves 8SR2 the second data set tothe second compute element 700-c 2, and updates the internal registry723-RG to reflect the serving of the second data set. The second computeelement 700-c 2 continues to perform processing 701-p 2 of data setsrelated to the task, here by processing the second data set received inresponse 8SR2.

As it becomes available or is about to become available to processadditional data sets, the first compute element 700-c 1 sends a thirddata request 8DR3 to the first data interface 523-G. The first datainterface 523-G concludes, based on information in the internal registry723-RG, that the first and second data sets have already been served tothe compute elements but a third data set is next for processing, so thefirst data interface 523-G extracts 700-f 3 the third data set 712-D3from the shared memory 512, serves 8SR3 the third data set to the firstcompute element 700-c 1, and updates the internal registry 723-RG toreflect the serving of the third data set. The first compute element700-c 1 continues to perform processing 701-p 3 of data sets related tothe task, here by processing the third data set received in response8SR3.

As it becomes available or is about to become available to processadditional data sets, the first compute element 700-c 1 sends a fourthdata request 8DR4 to the first data interface 523-G. The first datainterface 523-G concludes, based on information in the internal registry723-RG, that the first, second, and third data sets have already beenserved to the compute elements but a fourth data set is next forprocessing, so the first data interface 523-G extracts 700-f 4 thefourth data set 712-D4 from the shared memory 512, serves 8SR4 thefourth data set to the first compute element 700-c 1, and updates theinternal registry 723-RG to reflect the serving of the fourth data set.The first compute element 700-c 1 continues to perform processing 701-p4 of data sets related to the task, here by processing the third dataset received in response 8SR4.

It is understood that in all of the steps described above, the computeelements 700-c 1, 700-c 2 can process data sets only after they havereceived such data sets from the first data interface 523-G. The firstdata interface 523-G, however, has at least two alternative modes forfetching and sending data sets to the compute elements 700-c 1, 700-c 2.In one mode, the first data interface 523-G fetches a data set onlyafter it has received a data request from one of the compute elements.This mode is reflected in element 700-f 3, in which the first datainterface 523-G first receives a data request 8DR3 from the firstcompute element 700-c 1, the first data interface 523-G then fetches700-f 3 the third data set, and the first data interface 523-G thenserves 8SR3 third data set to the first compute element 700-c 1. In asecond mode, the first data interface 523-G first fetches the nextavailable data set before the first data interface 523-G has receivedany data request from any of the compute elements, so the first datainterface 523-G is ready to serve the next data set immediately uponreceiving the next data request from one of the compute elements 700-c1, 700-c 2. This mode is illustrated in 700-f 1, in which the first datainterface 523-G fetches a first data set prior to receiving the firstdata request 8DR1 from the first compute element 700-c 1, in 700-f 2, inwhich the first data interface 523-G fetches a second data set prior toreceiving the second data request 8DR2 from the second compute element700-c 2, and in 700-f 4, in which the first data interface 523-G fetchesa fourth data set prior to receiving the fourth data request 8DR4 fromthe first compute element 700-c 1. By this second mode, there is no lossof time that might have resulted if the first data interface 523-G werefetching a data set while the requesting compute element was waiting fordata.

FIG. 19B illustrates a time line, in which time begins at the top andcontinues towards the bottom. In one embodiment, over a first period709-per, the first compute element 700-c 1 issues exactly three datarequests 8DR1, 8DR3, and 8DR4, receiving respectively responses 8SR1,8SR3, and 8SR4 which include, respectively, a first data set 712-D1, athird data set 712-D3, and a fourth data set 712-D4, which the firstcompute element 700-c 1 then processes, 701-p 1, 701-p 3, 701-p 4,respectively. The first compute element 700-c 1 does not issueadditional data requests during the first period 709-per, because thefirst compute element 700-c 1 will not be able to process received datawithin the time of 709-per. In one embodiment, 8DR3 is issued only after701-p 1 is done or about to be done, and 8DR4 is issued only after 701-p3 is done or about to be done, such that the first compute element 700-c1 issues data requests at a rate that is associated with the processingcapabilities or availability of the first compute element 700-c 1.

In one embodiment, over the same first period 709-per, the secondcompute element 700-c 2 issues only one data request 8DR2, because thecorresponding processing 701-p 2 of the corresponding second data set712-d 2 requires long time, and further processing by the second computeelement 700-c 2 will not fit within the time period of 709-per. In thisway, the second compute element 700-c 2 issues data requests at a ratethat is associated to the processing capabilities or availability of thesecond compute element 700-c 2.

As explained above, each of the first compute element 700-c 1 and thefirst compute element 700-c 2 issues data requests in accordance withits processing capabilities or availability within a given time period.It is to be understood that data requests, receiving of data sets, andprocessing of data sets by the compute elements 700-c 1 and 700-c 2 arenot synchronized, and therefore are unpredictably interleaved. Further,the compute elements 700-c 1, 700-c 2 are not aware of exactly whichdata set is received per each data request, but the compute elements700-c 1, 700-c 2 do not request specific data sets, do not make theselection of which data sets they will receive, and do not know whichdata sets have been received from the first data interface 523-G. It isthe first data interface 523-G that decides which data sets to servebased on the records kept in the internal registry 723-RG, the data setsselected have never yet been served to the compute element 700-c 1,700-c 2, and the data sets are served by the first data interface 523-Gin response to specific data requests from the compute elements 700-c 1,700-c 2. The keeping of records in the internal registry 723-RG and theselection of data sets to be served based on those records, allows theachievement of load balancing among the various compute elements 700-c1, 700-c 2, and this is true whether or not the various compute elementshave the same processing capabilities or processing availabilities.

One embodiment is a system 740 operative to achieve load balancing amonga plurality of compute elements 700-c 1, 700-c 2, 700-cn accessing ashared memory pool 512. One particular form of such embodiment includesa shared memory pool 512 configured to store and serve a plurality ofdata sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 comprising atleast a first data set 712-D1 and a second data set 712-D2; a first datainterface 523-G configured to extract and serve any of the plurality ofdata sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 from the sharedmemory pool 512, and comprising an internal registry 723-RG configuredto keep track of the data sets extracted and served; and a plurality ofcompute elements 700-c 1, 700-c 2, 700-cn comprising at least a firstcompute element 700-c 1 and a second compute element 700-c 2, whereinthe plurality of compute elements 700-c 1, 700-c 2 are communicativelyconnected with the first data interface 523-G, and the plurality ofcompute elements 700-c 1, 700-c 2 are configured to executedistributively a first task associated with the plurality of data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6. Further, the firstcompute element 700-c 1 is configured to send a first data request 8DR1to the first data interface 523-G after deciding that the first computeelement is currently available or will be soon available to start orcontinue contributing to execution of the task (i.e., processing one ofthe data sets), and the first data interface 523-G is configured to (i)conclude, according to the records kept in the internal registry 723-RG,that the first data set 712-D1 is next for processing, (ii) extract700-f 1 the first data set 712-D1 from the shared memory pool 512, (iii)serve 8SR1 the first data set extracted to the first compute element700-c 1 for performing said contribution 701-p 1 (i.e., processing dataset 712-D1), and (iv) update the internal registry 723-RG to reflect theserving of the first data set 712-D1 to the first compute element 700-c1. Further, the second compute element 700-c 2 is configured to send asecond data request 8DR2 to the first data interface 523-G afterdeciding that the second compute element 700-c 2 is currently availableor will be soon available to start or continue contributing to executionof the task, and the first data interface 523-G is configured to (i)conclude, according to the internal registry 723-RG reflecting that thefirst data set 712-D1 has already been served, that the second data set712-D2 is next for processing, (ii) extract 700-f 2 the second data setfrom the shared memory pool 512, (iii) serve 8SR2 the second data setextracted to the second compute element 700-c 2 for performing thecontribution 701-p 2 (i.e., processing data set 712-D2), and (iv) updatethe internal registry 723-RG to reflect the serving of the second dataset 712-D2 to the second server 700-c 2. As herein described, thedecisions regarding the availabilities facilitate the load balancing inconjunction with the executing distributively of the first task, allwithout the plurality of compute elements 700-c 1, 700-c 2, 700-cn beingaware of the order in which the plurality of data sets are extracted andserved by the first data interface 523-G.

In one alternative embodiment to the system just described, further theplurality of data sets further comprises at least a third data set712-D3. Also, the first compute element 700-c 1 is further configured tosend a next data request 8DR3 to the first data interface 523-G afterdeciding that the first compute element 700-c 1 is currently availableor will be soon available to continue contributing to the execution ofthe task, and the first data interface 523-G is configured to (i)conclude, according to the internal registry 723-RG, that the third dataset 712-D3 is next for processing, (ii) extract 700-f 3 the third dataset from the shared memory pool 512, (iii) serve 8SR3 the third data setextracted to the first compute element 700-c 1 for performing thecontribution 701-p 3 (i.e., processing data set 712-D3), and (iv) updatethe internal registry 723-RG to reflect the serving of the third dataset 712-D3.

In one possible configuration of the first alternative embodiment justdescribed, further the next data request 8DR3 is sent only after thefirst compute element 700-c 1 finishes the processing 701-p 1 of thefirst data set 712-D1, thereby further facilitating said load balancing.

In a second possible configuration of the first alternative embodimentjust described, further the first data request 8DR1 and next datarequest 8DR3 are sent by the first compute element 700-c 1 at a ratethat corresponds to a rate at which the first compute element 700-c 1 iscapable of processing 701-p 1, 701-p 3 the first data set 712-D1 and thethird data set 712-D3, thereby further facilitating said load balancing.

In a second alternative embodiment to the above described system 740operative to achieve load balancing among a plurality of computeelements 700-c 1, 700-c 2, 700-cn accessing a shared memory pool 512,further the concluding and the updating guarantee that no data set isserved more than once in conjunction with the first task.

In a third alternative embodiment to the above described system 740operative to achieve load balancing among a plurality of computeelements 700-c 1, 700-c 2, 700-cn accessing a shared memory pool 512,further the conclusion by said first data interface 523-G regarding thesecond data set 712-D2 is made after the second data request 8DR2 hasbeen sent, and as a consequence of the second data request 8DR2 beingsent.

In a fourth alternative embodiment to the above described system 740operative to achieve load balancing among a plurality of computeelements 700-c 1, 700-c 2, 700-cn accessing a shared memory pool 512,further the conclusion by the first data interface 523-G regarding thesecond data set 712-D2 is made as a result of the first data set 712-D1being served 8SR1, and before the second data request 8DR2 has beensent, such that by the time the second data request 8DR2 has been sent,the conclusion by the first data interface 523-G regarding the seconddata set 712-D2 has already been made.

In a fifth alternative embodiment to the above described system 740operative to achieve load balancing among a plurality of computeelements 700-c 1, 700-c 2, 700-cn accessing a shared memory pool 512,further the extraction 700-f 2 of the second data set 712-D2 from theshared memory pool 512 is done after the second data request 8DR2 hasbeen sent, and as a consequence of the second data request 8DR2 beingsent.

In a sixth alternative embodiment to the above described system 740operative to achieve load balancing among a plurality of computeelements 700-c 1, 700-c 2, 700-cn accessing a shared memory pool 512,further the extraction 700-f 2 of the second data set 712-D2 from theshared memory pool 512 is done as a result of the first data set 712-D1being served 8SR1, and before the second data request 8DR2 has beensent, such that by the time the second data request 8DR2 has been sent,the second data set 712-D2 is already present in the first datainterface 523-G and ready to be served by the first data interface 523-Gto a compute element.

FIG. 20 illustrates one embodiment of a method for load balancing aplurality of compute elements accessing a shared memory pool. In step1101, a system is configured in an initial state in which a plurality ofdata sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 belonging to afirst data corpus are stored in a shared memory pool 512 associated witha first data interface 523-G, such that each of the plurality of datasets is stored only once. In step 1102, the internal registry 723-RG ofa first data interface 523-G keeps a record about which of the pluralityof data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 are storedin the shared memory pool 512 and which of the plurality of data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 were served by the firstdata interface 523-G to any one of the plurality of compute elements700-c 1, 700-c 2, 700-cn. In step 1103, the first data interface 523-Greceives data requests 8DR1, 8DR2, 8DR3, 8DR4 from any of plurality ofcompute elements 700-c 1, 700-c 2, 700-cn, in which the rates of requestfrom the various compute elements 700-c 1, 700-c 2, 700-cn may varybased on factors such as the processing capabilities of the variouscompute elements 700-c 1, 700-c 2, 700-cn and the availability ofprocessing time and resources given the various processing activitiesbeing executed by each of the compute elements 700-c 1, 700-c 2, 700-cn.In step 1104, in response to the each of the data requests sent by acompute element and received by the first data interface 523-G, thefirst data interface 523-G serves one of the data sets 712-D1, 712-D2,712-D3, 712-D4, 712-D5, 712-D6 that is stored in the shared memory pool512 and that is selected for sending to the compute element making thedata request, where the data set is selected and served on the basis ofthe records kept in the internal registry 723-RG such that the data setserved is guaranteed not to have been sent previously by the first datainterface 523-G since the start from the initial state of the system740. For example, the first data interface 523-G may select and serve,based on the records kept in the internal registry 723-RG, the seconddata set 712-D2 to be sent in response to a second data request 8DR2from the second compute element 700-c 2, wherein the records kept ininternal registry 723-RG guarantee that this second data set 712-D2 hasnot yet been served to any of the compute elements 700-c 1, 700-c 2,700-cn. The results are that (i) each data set is served by the firstdata interface 523-G and processed by one of the compute elements onlyonce; and (ii) each of the plurality of compute elements 700-c 1, 700-c2, 700-cn is served data at a rate that is proportional to the rate atwhich such compute element makes data requests. This proportionality,and the serving of data sets in direct relation to such proportionality,means that load balancing is achieved among the plurality of computeelements 700-c 1, 700-c 2, 700-cn.

In one alternative embodiment to the method just described, further theinitial state is associated with a first task to be performed by theplurality of compute elements 700-c 1, 700-c 2, 700-cn in conjunctionwith the first data corpus, and the initial state is set among the firstdata interface 523-G and the plurality of compute elements 700-c 1,700-c 2, 700-cn in conjunction with the first task, thereby allowing thekeeping record, receiving, and serving to commence.

In one possible configuration of the alternative embodiment justdescribed, said record keeping, receiving, and serving allow theplurality of compute elements 700-c 1, 700-c 2, 700-cn to distributivelyperform the first task, such that each of the plurality of computeelements 700-c 1, 700-c 2, 700-cn performs a portion of the first taskthat is determined by the compute element itself according to the rateat which that compete element is making data requests to the first datainterface 523-G.

In one possible variation of the configuration just described, the rateat which each compute element makes data requests is determined by thecompute element itself according to the present load on the computeelement or the availability of computational capability of the computeelement.

In one option of the variation just described, the data requests 8DR1,8DR2, 8DR3, 8DR4 do not specify specific identities of the data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 to be served, such thatthe specific identities of the data sets served are determined solely bythe first data interface 523-G according to the records kept by theinternal registry 723-RG, thereby allowing the plurality of computeelements 700-c 1, 700-c 2, 700-cn to perform the first taskasynchronously, thereby allowing the plurality of compute elements 700-c1, 700-c 2, 700-cn to achieve load balancing efficiently.

In a second possible configuration of the alternative embodimentdescribed above, the receiving of data requests and the serving of datasets in response to the data requests, end when the entire first datacorpus has been served to the plurality of compute element 700-c 1,700-c 2, 700-cn.

In a possible variation of the second configuration just described, theexecution of the first task is achieved after the entire data corpus hasbeen served to the plurality of compute elements 700-c 1, 700-c 2,700-cn, and after each of the compute elements has processed all of thedata sets that were served to that compute element by the first datainterface 523-G.

In a third possible configuration of the alternative embodimentdescribed above, further the first data interface 523-G performs on theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 apre-processing activity associated with the first task, after theextracting 700-f 1, 700-f 2, 700-f 3, 700-f 4 of the data sets and priorto the serving 8SR1, 8SR2, 8SR3, 8SR4 of the data sets.

FIG. 21A illustrates one embodiment of a system 740 operative to achievedata resiliency in a shared memory pool 512. The system 740 includesmultiple compute elements 700-c 1, 700-c 2, 700-cn, that execute variousfunctions such as requesting data, receiving data, streaming request towrite to memory, and processing data. The system 740 includes alsomultiple erasure-encoding interfaces 741-1, 741-2, 741-m, that executevarious functions such as receiving data requests from compute elements,sending secondary data requests to data interfaces, receiving datafragments from data interfaces, reconstructing data sets, sendingreconstructed data sets to compute elements as responses to requests fordata, receiving streamed requests to write to memory, erasure-codingdata sets into data fragments, creating multiple sub-streams of datafragments, and sending the sub-streams to memory modules to be added tomemory.

The system 740 includes also a shared memory pool 512 with multiplememory modules 540-m 1, 540-m 2, 540-mk, that execute various functionsincludes storing data sets in the form of data fragments. For example,as shown in FIG. 21A, a first data set 712-D1 has been coded 7 code atthe top into multiple data fragments 7D1-1, 7D1-2, 7D1-k, in which thevarious fragments are stored in different memory modules, first datafragment 7D1-1 in first memory module 540-m 1, second data fragment7D1-2 in second memory module 540-m 2, and third data fragment 7D1-k inthird memory module 540-mk. Similarly, FIG. 21A shows a second data set712-D2 that has been coded 7 code at the bottom into multiple datafragments 7D2-1, 7D2-2, 7D2-k, in which the various fragments are storedin different memory modules, first data fragment 7D2-1 in first memorymodule 540-m 1, second data fragment 7D2-2 in second memory module 540-m2, and third data fragment 7D2-k in third memory module 540-mk Althoughonly two data sets are shown in FIG. 21A, it is understood that theremay be many more data sets in a system. Although each data set is shownin FIG. 21 to be coded into three data fragments, it is understood thatany data set may be coded into two, four, or any higher number of datafragments. In the particular embodiment shown in FIG. 21A, there are atleast two separate severs, a first server 700-S-1 that includes a firstmemory module 540-m 1 and a first data interface 523-1, and a secondserver 700-S-2 that includes a first erasure-coding interface 741-1.

It should be understood that there may be any number of servers or otherpieces of physical hardware in the system 740, and such servers orhardware may include any combination of the physical elements in thesystem, provided that the entire system 740 includes all of the computeelements 700-c 1, 700-c 2, 700-ck, all of the erasure-coding interfaces741-1, 741-2, 741-k, all of the data interfaces 523-1, 523-2, 523-k, andall of the memory modules 540-m 1, 540-m 2, 540-mk, plus whatever otherhardware elements have been added to the system 740. For example, onesystem might have a server including all of the memory modules and allof the data interfaces, a separate server including all of theerasure-coding interfaces, and a separate server including all of thecompute elements. Or alternatively, there may be two more servers forthe compute elements, and/or two or more servers for the erasure-codinginterfaces, and/or two or more servers for the data interfaces andmemory modules. In alternative embodiments, one or more compute elementsmay be co-located on a server with one or more erasure-coding interfacesand/or one or more data interfaces and memory modules, provided that allof the compute elements, erasure-coding interfaces, data interfaces, andmemory modules are located on some server or other physical hardware.

FIG. 21B illustrates one embodiment of a sub-system with a computeelement 700-c 1 making a data request 6DR1 to an erasure-encodinginterface 741-1 which converts the request to a plurality of secondarydata requests 6DR1-a, 6DR1-b, 6DR1-k, and sends such secondary datarequests to a plurality of data interfaces 523-1, 523-2, 523-k. Asshown, each secondary data request is sent to a separate data interface.

FIG. 21C illustrates one embodiment of a sub-system with the pluralityof data interfaces 523-1, 523-2, 523-k using random-access read cycles6RA1-a, 6RA1-b, 6RA-k, to extract multiple data fragments 7D1-1, 7D1-2,7D1-k stored in associated memory modules 540-m 1, 540-m 2, 540-mk Inthe embodiment illustrated in FIG. 21C, the data fragments are part of adata set 712-D1 not shown in FIG. 21C. In the embodiment illustrated inFIG. 21C, the data fragments are stored in random access memory (RAM),which means that the data interfaces extract and fetch the datafragments very quickly using a random access read cycle or severalrandom access read cycles. In the embodiment shown in FIG. 21C, exactlyone data interface is associated with exactly one memory module in orderto support simultaneity in accessing the various data fragments 7D1-1,7D1-2, 7D1-k, but in alternative embodiments the various data interfacesand memory modules may be associated otherwise, provided however thatthe multiple data fragments 7D1-1, 7D1-2, 7D1-k may be extracted inparallel by a plurality of data interfaces, such that the multiple datafragments 7D1-1, 7D1-2, 7D1-k may be fetched quickly by the various datainterface, and possibly during several clock cycles in which the variousdata interfaces access the various memory modules in parallel usingsimultaneous random access read cycles. Such simultaneity in randomaccess is critical for achieving low latency that is comparable tolatencies associated with randomly accessing uncoded data stored in RAM.

FIG. 21D illustrates one embodiment of a sub-system with the pluralityof data interfaces 523-1, 523-2, 523-k, sending, as responses 6SR1-a,6SR1-b, 6SR1-k to a secondary data requests 6DR1-a, 6DR1-b, 6DR1-k(shown in FIG. 21B), data fragments 7D1-1, 7D1-2, 7D1-k to anerasure-coding interface 741-1 which reconstructs 7 rec the originaldata set 712-D1 from the data fragments and sends such reconstructeddata set 712-D1 to a compute element 700-c 1 as a response 6SR-1 to thatcompute element's request for data 6DR-1 (shown in FIG. 21B). The datafragments may be sent serially to the erasure-coding interface 741-1,which might be, for example, 7D1-1, then 7D1-2, then 7D1-k, then 7D2-1(part of second data set 712-D2 shown in FIG. 21A), then 7D1-2 (part ofdata set 712-D2 shown in FIG. 21A), then 7D1-k (part of data set 712-D2shown in FIG. 21A). The data fragments 7D1-1, 7D1-2, 7D1-k may be sentsimultaneously to the erasure-coding interface 741-1 using a switchingnetwork such as switching network 550 (FIG. 21A), which may be selectedfrom a group consisting of: (i) a non-blocking switching network, (ii) afat tree packet switching network, and (iii) a cross-bar switchingnetwork, in order to achieve a low latency that is comparable tolatencies associated with randomly accessing uncoded data stored in RAM.The erasure-coding interface 741-1 may reconstruct 7 rec the data set712-D1 even if one of the data fragments 7D1-1, 7D1-2, 7D1-k is eithermissing or corrupted, and this is one aspect of data resiliency of theoverall system 740. In the embodiment shown in FIG. 21D, all of the datainterfaces are communicatively connected with a single erasure-codinginterface 741-1 which is communicatively connected with exactly onecompute element 700-c 1, but in alternative embodiments the various datainterfaces may be communicatively connected with various erasure-codinginterfaces, and the various erasure-coding interfaces may becommunicatively connected with various compute elements, through theswitching network 550 discussed previously.

FIG. 21E illustrates one embodiment of a sub-system with a computeelement 700-c 1 streaming 7STR a data set 712-D1 (shown in FIG. 21D) toan erasure-coding interface 741-1 which converts the data set into datafragments 7D1-1, 7D1-2, 7D1-k and streams 7STR1, 7STR2, 7STRk such datafragments to multiple data interfaces 523-1, 523-2, 523-k, which thenwrite 7WR1, 7WR2, 7WRk each data fragment in real-time in the memorymodules 540-m 1, 540-m 2, 540-mk associated with the data interfaces.The physical connection between the compute element 700-c 1 and theerasure-coding interface, here in FIG. 21E or in any of the FIG. 21A,21B, or 21D, may be a peripheral-component-interconnect-express (PCIE)computer expansion bus, an Ethernet connection, an Infinibandconnection, or any other physical connection permitting high-speedtransfer of data between the two physical elements, such as switchingnetwork 550. The coding of the data fragment streams 7STR1, STR2, STRkby the erasure-coding interface 741-1 may be done very quickly, in“real-time”. The data interfaces 523-1, 523-2, 523-k write 7WR1, 7WR2,7WRk the data fragments 7D1-1, 7D1-2, 7D1-k to the memory modules 540-m1, 540-m 2, 540-mk in RAM using fast random access cycles, which meansthat the writing process is very fast, possibly as fast as a singlerandom access write cycle into a RAM.

One embodiment is a system 740 operative to achieve data resiliency in ashared memory pool 512. One particular form of such embodiment includesa plurality of memory modules 540-m 1, 540-m 2, 540-mk belonging to ashared memory pool 512 and associated respectively with a plurality ofdata interfaces 523-1, 523-2, 523-k; a first erasure-coding interface741-1 communicatively connected with the plurality of data interfaces523-1, 523-2, 523-k; and a first compute element 700-c 1 communicativelyconnected with the first erasure-coding interface 741-1. Further, theplurality of memory modules 540-m 1, 540-m 2, 540-mk are configured todistributively store a plurality of data sets 712-D1, 712-D2, such thateach data set is distributively stored among at least two of the memorymodules in a form of a plurality of data fragments coded using a firsterasure-coding scheme, and each data fragment is stored on a differentone of the at least two memory modules. As an example, a first data set712-D1 may include first data fragment 7D1-1 stored in first memorymodule 540-m 1, second data fragment 7D1-2 stored in second memorymodule 540-m 2, and third data segment 7D1-k stored in third memorymodule 540-mk. As another example, as either a substitute for the firstdata set 712-D1, or in addition to the first data set 712-D1, there maybe a second data set 712-D2, including a first data fragment 7D2-1stored in first memory module 540-m 1, a second data fragment 7D2-2stored in second memory module 540-m 2, and a third data segment 7D2-kstored in third memory module 540-mk. Further, the first compute element700-c 1 is configured to send to the first erasure-coding interface741-1 a request 6DR1 for one of the data sets. For example, the firsterasure-encoding interface may request a first data set 712-D1. Further,the first erasure-coding interface 741-1 is configured to (i) convertthe request into a first plurality of secondary data requests 6DR1-a,6DR1-b, 6DR1-k; (ii) send the first plurality of secondary datarequests, respectively, into at least a first sub-set of the pluralityof data interfaces 523-1, 523-2, 523-k; (iii) receive as responses6SR1-a, 6SR1-b, 6SR1-k at least a sub-set of the plurality of datafragments 7D1-1, 7D1-2, 7D1-k associated with the one of the data sets712-D1; (iv) reconstruct 7 rec the one of the data sets 712-D1, usingthe first erasure-coding scheme, from the data fragments received 7D1-1,7D1-2, 7D1-k; and (v) send the reconstruction to the first computeelement 700-c 1 as a response 6SR1 to the request 6DR1 made. Further,each of the plurality of data interfaces, that is, each of 523-1, 523-2,523-k, is configured to (i) receive, from the first erasure-codinginterface 741-1, one of the plurality of secondary data requests (suchas, for example secondary data request 6DR1-a received at first dateinterface 523-1); (ii) extract, from the respective memory module (suchas, for example, from first memory module 540-m 1 associated with firstdata interface 523-1), using a random-access read cycle 6RA1-a, one ofthe data fragments 7D1-1 associated with the one secondary data request;and (iii) send 6SR1-a the data fragment 7D1-1 extracted to the firsterasure-coding interface 741-1 as part of the responses received by thefirst erasure-coding interface 741-1.

In a first alternative embodiment to the system just described, furtherone of the plurality of memory modules 540-m 1 and its associated datainterface 523-1 are located in a first server 700-S-1. Further, thefirst erasure-coding interface 741, the first compute element 700-c 1,others of the plurality of memory modules 540-m 2, 540-mk, and others ofthe associated data interfaces 523-2, 523-k, are all located outside thefirst server 700-S-1. The ultimate result is that, due to the uses ofthe first erasure-coding interface 741-1 and the first erasure-codingscheme, the system 740 is a distributed system that is configured toendure any failure in the first server 700-S-1, and further that thereconstruction 7 rec is unaffected by the possible failure in the firstserver 700-S-1.

In one possible configuration of the first alternative embodiment justdescribed, the system 740 includes also additional erasure-codinginterfaces 741-2, 741-m, each configured to perform all tasks associatedwith the first erasure-coding interface 741-1, such that any failure ofthe first erasure-coding interface 741-1 still allows the system 740 toperform the reconstruction 7 rec using at least one of the additionalerasure-coding interfaces (such as the second erasure-coding interface741-2) instead of the failed first erasure-coding interface 741-1.

In one possible variation of the configuration just described, furtherthe first erasure-coding interface 741-1 is located in a second server700-S-2, while the additional erasure-coding interfaces 714-2, 741-m,the first compute element 700-c 1, the others of the plurality of memorymodules 540-m 2, 540-mk, and the associated data interfaces 523-2,523-k, are all located outside said second server 700-S-2. The result isthat the system 740 is further distributed, and is configured to endureany failure in the second server 700-S-2, such that the reconstruction 7rec would still be possible even after a failure in the second server700-S-2.

In a second alternative embodiment to the above-described system 740operative to achieve data resiliency in a shared memory pool, the system740 further includes additional erasure-coding interfaces 741-2, 741-m,each of which is configured to perform all tasks associated with thefirst erasure-coding interface 741-1. Further, the system 740 alsoincludes additional compute elements 700-c 2, 700-cn, each of which isconfigured to associate with at least one of the erasure-codinginterfaces (for example, compute element 700-c 2 with erasure-codinginterface 741-2, and compute element 700-cn with erasure-codinginterface 741-m) in conjunction with erasure-coding transactions such as7 rec and alike, associated with the plurality of memory modules 540-m1, 540-m 2, 540-mk and the plurality of data fragments 7D1-1, 7D1-2,7D1-k, 7D2-1, 7D2-2, 7D2-k. As a result of the additions set forth inthis second possible alternative, each of the plurality of computeelements, including the first compute element, is configured to receiveone of the data sets 712-D1 reconstructed 7 rec using at least one ofthe additional erasure-coding interfaces 741-2, and also the sharedmemory pool 512 is configured to serve the plurality of data sets712-D1, 712-D2 to the plurality of compute elements regardless of anyfailure in one of the memory modules 540-m 1, 540-m 2, 540-mk.

In one possible option for the second alternative embodiment justdescribed, each erasure-coding interface 741-2, 741-2, 741-m isassociated with one of the compute elements 700-c 1, 700-c 2, 700-cn.

In another possible option for the second alternative embodiment justdescribed, each of the compute elements 700-c 1, 700-c 2, 700-cn can useany one or any combination of the erasure-encoding interfaces 741-2,741-2, 741-m, thereby creating a resilient matrix of both data anderasure-coding resources, capable of enduring any single failurescenario in the system. In one possible option of this embodiment, thedifferent elements in the resilient matrix are interconnected using aswitching network or an interconnect fabric 550.

In one possible configuration of the second alternative embodiment,further the plurality of memory modules 540-m 1, 540-m 2, 540-mk arebased on dynamic-random-access-memory (DRAM), at least 64 (sixty four)memory modules are included in the plurality of memory modules, and thefirst erasure-coding interface 741-1 together with the additionalerasure-coding interfaces 741-2, 741-m are communicatively connectedwith the plurality of data interfaces 523-1, 523-2, 523-k using aswitching network 550 selected from a group consisting of: (i) anon-blocking switching network, (ii) a fat tree packet switchingnetwork, and (iii) a cross-bar switching network. One result of thispossible configuration is that a rate at which the data sets 712-D1,712-D2 are being reconstructed 7 rec is at least 400 Giga-bits-persecond.

In a third alternative embodiment to the above-described system 740operative to achieve data resiliency in a shared memory pool, furtherthe plurality of memory modules 540-m 1, 540-m 2, 540-mk are based onrandom-access-memory (RAM), and therefore the random-access read cycles6RA1-a, 6RA1-b, 6RA1-k allow the extraction to proceed at data ratesthat support the first compute element 700-c 1 in receiving said datasets 712-D1, 712-D2, after said reconstruction 7 rec, at data rates thatare limited only by the ability of the first compute element 700-c 1 tocommunicate.

In one possible configuration of the third alternative embodiment,further the random-access-memory in memory modules 540-m 1, 540-m 2,540-mk is a dynamic-random-access-memory (DRAM), and the firsterasure-coding interface 741-1 is communicatively connected with theplurality of data interfaces 523-1, 523-2, 523-k using a switchingnetwork 550 selected from a group consisting of: (i) a non-blockingswitching network, (ii) a fat tree packet switching network, and (iii) across-bar switching network. One result of this possible configurationis that a first period beginning in the sending of the request 6DR1 andending in the receiving of the response 6SR1 to the request is boundedby 5 (five) microseconds. In one embodiment, said random-access readcycles 6RA1-a, 6RA1-b, 6RA-k are done simultaneously, as facilitated bythe plurality of data interfaces 523-1, 523-2, 523-k acting together,thereby facilitating said bound of 5 (five) microseconds.

In a second possible configuration of the third alternative embodiment,further the random-access-memory in memory modules 540-m 1, 540-m 2,540-mk is a dynamic-random-access-memory (DRAM), and the firsterasure-coding interface 741-1 is communicatively connected with theplurality of data interfaces 523-1, 523-2, 523-k using a switchingnetwork 550 selected from a group consisting of: (i) a non-blockingswitching network, (ii) a fat tree packet switching network, and (iii) across-bar switching network. One result of this possible configurationis that a rate at which the data sets 712-D2, 712-D2 are beingreconstructed is at least 100 Giga-bits-per second.

In a fourth alternative embodiment to the above-described system 740operative to achieve data resiliency in a shared memory pool, furtherthe one of the data sets 712-D1 is a first value 618-v 1 (illustrated inFIGS. 11A and 13A) associated with a first key 618-k 1 (illustrated inFIGS. 11A and. 13A), and the first value 618-v 1 is stored as one of thepluralities of data fragments 7D1-1, 7D1-2, 7D1-k in the plurality ofmemory modules 540-m 1, 540-m 2, 540-mk. Further, the request 6DR1 forone of the data sets 712-D1 is a request for the first value 618-v 1, inwhich the request 6DR1 conveys the first key 618-k 1. Further, the firstplurality of secondary data requests 6DR1-a, 6DR1-b, 6DR1-k are requestsfor the one of the pluralities of data fragments 7D1-1, 7D1-2, 7D1-k, inwhich each of the requests for the one of the pluralities of datafragments conveys the first key 618-k 1 or a derivative of the first key618-k 1 to the respective data interface 523-1, 523-2, 523-k. Further,the respective data interface 523-1, 523-2, 523-k is configured to usethe first key 618-k 1 or a derivative of the first key to determine anaddress from which to perform said random access read cycles 6RA1-a,6RA1-b, 6RA1-k.

One embodiment is a system 740 operative to stream data resiliently intoa shared memory pool 512. One particular form of such embodimentincludes a plurality of memory modules 540-m 1, 540-m 2, 540-mkbelonging to a shared memory pool 512 and associated respectively with aplurality of data interfaces 523-1, 523-2, 523-k, a first erasure-codinginterface 741-1 communicatively connected with the plurality of datainterfaces 523-1, 523-2, 523-k, and a first compute element 700-c 1communicatively connected with the first erasure-coding interface 741-1.Further, the first compute element 700-c 1 is configured to stream 7STRa plurality of data sets 712-D1, 712-D2 into the first erasure-codinginterface 741-1. Further, the first erasure-coding interface 741-1 isconfigured to (i) receive the stream; (ii) convert in real-time each ofthe plurality of data sets 712-D1, 712-D2 in the stream into a pluralityof data fragments (for example, first plurality 7D1-1, 7D1-2, 7D1-k, andsecond plurality 7D2-1, 7D2-2, 7D2-k) using a first erasure-codingscheme; and stream each of the pluralities of data fragmentsrespectively into the plurality of data interfaces (for example, 7D1-1,7D1-2, and 7D1-k into 523-1, 523-2, and 523-k, respectively), such thata plurality of sub-streams 7STR1, 7STR2, 7STRk of data fragments arecreated in conjunction with the plurality of data interfaces. Further,each of the data interfaces 523-1, 523-2, 523-k is configured to (i)receive one of said sub-streams of data fragments (for example, 523-1receiving sub-stream 7STR1 containing fragments 7D1-1 and 7D2-1), and(ii) write in real-time each of the data fragments in the sub-streaminto the respective memory module (for example, into memory module 540-m1 associated with data interface 523-1) using a random-access writecycle 7WR1. One result of this embodiment is a real-time erasure-codingof the stream 7STR of data sets into the shared memory pool 512 asfacilitated by the first erasure-coding interface 741-1 and multiplerandom-access write cycles 7WR1, 7WR2, 7WRk, each of which is associatedwith a data interface 523-1, 523-2, 523-k.

In an alternative embodiment to the system 740 just described to streamdata resiliently into a shared memory pool 512, further the plurality ofmemory modules 540-m 1, 540-m 2, 540-mk are based onrandom-access-memory (RAM), and therefore the random-access write cycles7WR1, 7WR2, 7WRk allow the writing to proceed at data rates that supportthe first compute element 700-c 1 in writing the data sets 712-D1,712-D2, after said conversion, at data rates that are limited only bythe ability of the first compute element 700-c 1 to communicate.

In one possible configuration of the alternative embodiment justdescribed, further the random-access-memory 540-m 1, 540-m 2, 540-mk isa dynamic-random-access-memory (DRAM), and the first erasure-codinginterface 741-1 is communicatively connected with the plurality of datainterfaces 523-1, 523-2, 523-k using a switching network selected 550from a group consisting of: (i) a non-blocking switching network, (ii) afat tree packet switching network, and (iii) a cross-bar switchingnetwork. One result of this possible configuration is that any one ofthe data sets 712-D1, 712-D2 is written in the plurality of memorymodules 540-m 1, 540-m 2, 540-mk no later than 5 (five) microsecondsfrom being put in said stream 7STR. In one embodiment, saidrandom-access write cycles 7WR1, 7WR2, 7WRk are done simultaneously, asfacilitated by the plurality of data interfaces 523-1, 523-2, 523-kacting together, thereby facilitating said bound of 5 (five)microseconds.

In a second possible configuration of the alternative embodimentdescribed above to the system 740 operative to stream data resilientlyinto a shared memory pool 512, further the random-access-memory 540-m 1,540-m 2, 540-mk is a dynamic-random-access-memory (DRAM), and the firsterasure-coding interface 741-1 is communicatively connected with theplurality of data interfaces 523-1, 523-2, 523-k using a switchingnetwork 550 selected from a group consisting of: (i) a non-blockingswitching network, (ii) a fat tree packet switching network, and (iii) across-bar switching network. One result of this possible configurationis that a rate at which the data sets 712-D1, 712-D2 are being writtenis at least 100 Giga-bits-per second.

FIG. 22A illustrates one embodiment of a system 760 operative tocommunicate, via a memory network 760-mem-net, between compute elements500-c 1, 500-c 2 and external destinations 7DST. The system includes aplurality of compute elements 500-c 1, 500-c 2, a memory network760-mem-net, and a gateway compute node 500-gate. The gateway computenode 500-gate is configured to obtain 761-obt, from the plurality ofcompute nodes 500-c 1, 500-c 2, via the memory network 760-mem-net,using a first communication protocol adapted for low latencytransmissions, a plurality of general communication messages 7 mesintended for a plurality of destinations 7DST external to the system760. The first communication protocol may be the same communicationprotocol used in a switching network 550 (FIG. 22B), or be anothercommunication protocol adapted for low latency transmissions. Thegateway compute node 500-gate is also configured to transmit 762-TR theplurality of general communication messages 7 mes to said plurality ofdestinations 7DST external to the system, via a general communicationnetwork 760-gn, using a second communication protocol adapted for thegeneral communication network 760-gn.

FIG. 22B illustrates one embodiment of a system 760 operative tocommunicate, via a switching network 550, between compute elements 500-c1, 500-c 2 and memory modules 540-m 1, 540-m 2, 540-mk storing data sets512-Dn, 512-D1, 512-D2, respectively. The system 760 includes aplurality of compute elements 500-c 1, 500-c 2, which may be in aseparate server 560-S-1. FIG. 22B shows a first compute element 500-c 1in a separate server 560-S-1, and a second compute element 500-c 2 whichis not part of a separate server, but it is understood that multiplecompute elements may be contained with a single separate server, or eachcompute element may be part of its own separate server, or none of thecompute elements may be part of any separate server. The plurality ofcompute elements 500-c 1, 500-c 2 are configured to access 512-D1-TR,512-D2-TR the plurality of data sets 512-D1, 512-D2, 512-Dn via theswitching network 550 using the first communication protocol adapted forlow latency transmissions, thereby resulting in the memory network760-mem-net having a first latency performance in conjunction with theaccess. FIG. 22B illustrates one possible embodiment of the memorynetwork 760-mem-net illustrated in FIG. 22A. In FIG. 22B, the memorynetwork 760-mem-net includes a switching network 550 and a shared memorypool 512.

The shared memory pool includes the memory modules 540-m 1, 540-m 2,540-mk, including the data sets 512-Dn, 512-D1, 512-D2, respectively.Data interfaces 523-1, 523-2, 523-3 are associated with the memorymodules, 540-m 1, 540-m 2, 540-mk, respectively, and are communicativelyconnected with the switching network 550. FIG. 22B shows the firstmemory module 540-m 1 and first data interface 523-1 included in aseparate server 560-S-2, whereas the other memory modules 540-m 2,540-mk and their respective data interfaces 523-2, 523-k, are notincluded in separate server 560-S-2 or in any other separate server.However, it is understood that any combination of separate servers ispossible, including no servers for any of the memory modules or datainterfaces, a single separate server for all of the memory modules anddata interfaces, each pair of a memory module and its associated datainterface in a separate module, or some pairs of memory modules and datainterfaces in separate servers while other pairs are not in separateservers. The system 760 also includes the gateway compute node 550-gate,which, as shown in FIG. 22B, is in a separate server 560-S-3, but whichin alternative embodiments may be part of another server with otherelement of the system 760, and in additional alternative embodiments isnot placed in a separate server.

The system 760 achieves communication with the destinations 7DST via thememory network 760-mem-net, while simultaneously achieving, using thememory network 760-mem-net, the access 512-D1-TR, 512-D2-TR by theplurality of compute elements 500-c 1, 500-c 2 to the plurality of datasets 512-D1, 512-D2, 512-Dn in conjunction with the first latencyperformance associated with such access. One result is that the lowlatency between the compute elements 500-c 1, 500-c 2 and the data sets512-D1, 512-D2, 512-Dn is preserved with no negative impact bycommunications between the compute element 500-c 1, 500-c 2 and theplurality of external destinations 7DST. The forwarded communication(transmission 762-TR) with the external destinations 7DST, that is, fromthe gateway compute node 500-gate to the external destinations 7DST,uses a second communication protocol that may or may not be low latency,since the latency of communication between the compute elements 500-c 1,500-c 2 and the external destinations 7DST is generally less criticalfor system performance than latency between the compute elements 500-c1, 500-c 2 and the data sets 512-Dn, 512-D2, 512-D2.

One embodiment is a system 760 operative to communicate withdestinations 7DST external to the system 760 via a memory network760-mem-net. In a particular embodiment, the system 760 includes agateway compute node 500-gate, a plurality of compute elements 500-c 1,500-c 2, and a memory network 760-mem-net. In a particular embodiment,the memory network 760-mem-net includes a shared memory pool 512configured to store a plurality of data sets 512-D1, 512-D2, 512-Dn, anda switching network 550. Further, the plurality of compute elements500-c 1, 500-c 2 are configured to access 512-D1-TR, 512-D2-TR theplurality of data sets 512-D1, 512-D2, 512-Dn via the switching network550 using a first communication protocol adapted for low latencytransmissions, thereby resulting in the memory network 760-mem-nethaving a first latency performance in conjunction with the access by thecompute elements 500-c 1, 500-c 2. Further, the gateway compute node500-gate is configured to obtain 761-obt, from the plurality of computenodes 500-c 1, 500-c 2, via the memory network 760-mem-net, using thefirst communication protocol or another communication protocol adaptedfor low latency transmissions, a plurality of general communicationmessages 7 mes intended for a plurality of destinations 7DST external tothe system 760. The gateway compute node 500-gate is further configuredto transmit 762-TR the plurality of general communication messages 7 mesto the plurality of destinations 7DST external to the system 760, via ageneral communication network 760-gn, using a second communicationprotocol adapted for the general communication network 760-gn. Oneresult is that the system 760 achieves the communication with thedestinations 7DST via the memory network 760-mem-net, whilesimultaneously achieving, using the memory network, the access512-D1-TR, 512-D2-TR to the plurality of data sets 512-D1, 512-D2,512-Dn in conjunction with said first latency performance.

In a first alternative embodiment to the system just described, furtherthe switching network 550 is a switching network selected from a groupconsisting of: (i) a non-blocking switching network, (ii) a fat treepacket switching network, and (iii) a cross-bar switching network,thereby facilitating the access 512-D1-TR, 512-D2-TR being simultaneousin conjunction with at least some of the plurality of data sets 512-D1,D2, 512-Dn, such that at least one 512-D1 of the data sets is accessedsimultaneously with at least another 512-D2 of the data sets, therebypreventing delays associated with the access, thereby furtherfacilitating the first latency performance in conjunction with the firstcommunication protocol.

In a second alternative embodiment to the system described above,further the shared memory pool 512 includes a plurality of memorymodules 540-m 1, 540-m 2, 540-mk associated respectively with aplurality of data interfaces 523-1, 523-2, 523-k communicativelyconnected with the switching network 550, in which the plurality of datasets 512-D1, 512-D2, 512-Dn are distributed among the plurality ofmemory modules, such that each data interface (e.g., 523-2) isconfigured to extract from its respective memory module (e.g., 540-m 2)the respective data set (e.g., 512-D1) simultaneously with another ofthe data interfaces (e.g., 523-k) extracting from its respective memorymodule (e.g., 540-mk) the respective data set (e.g., 512-D2), and suchthat, as a result, at least one of the data sets (e.g., 512-D1) istransported to one of the compute elements (e.g., 500-c 1), inconjunction with the access 512-D1-TR, simultaneously with at leastanother of the data sets (e.g., 512-D2) being transported to another ofthe compute elements (e.g., 500-c 2) in conjunction with the access512-D2-TR, thereby preventing delays associated with said access,thereby further facilitating the first latency performance inconjunction with the first communication protocol.

In a first possible configuration of the second alternative embodimentjust described, further the memory modules 540-m 1, 540-m 2, 540-mk arebased on random-access-memory (RAM), in which the extraction of the datasets 512-Dn, 512-D1, 512-D21 is performed using random access readcycles, thereby further facilitating the first latency performance inconjunction with said first communication protocol.

In a possible variation of the first possible configuration justdescribed, further, the memory modules 540-m 1, 540-m 2, 540-mk arebased on dynamic-random-access-memory (DRAM), in which the extraction ofthe data sets 512-Dn, 512-D1, 512-D2 is done in less than 2 (two)microseconds, and the access 512-D1-TR is done in less than 5 (five)microseconds.

In a second possible configuration of the second alternative embodimentdescribed above, further the obtaining 761-obt includes writing, by oneor more of the compute elements 500-c 1, 500-c 2, the generalcommunication messages 7 mes into one or more of the memory modules540-m 1, 540-m 2, 540-mk, and the obtaining 761-obt includes alsoreading, by the gateway compute node 500-gate, the general communicationmessages 7 mes from the memory modules 540-m 1, 540-m 2, 540-mk.

In a possible variation of the second possible configuration justdescribed, further the writing includes sending, by one of the computeelements 500-c 1, 500-c 2 to one of the data interfaces 523-1, 523-2,523-k, via the switching network 550, using a packetized messageassociated with the first communication protocol, one of the generalcommunication messages 7 mes, and the writing further include writingone of the general communication messages 7 mes, by the specific datainterfaces (e.g., 523-1), to the memory module (e.g., 540-m 1)associated with that data interface (523-1), using a random-access writecycle.

In a possible option for the possible variation just described, readingfurther includes reading one of the general communication messages 7mes, by one of the data interfaces (e.g., 523-1), from the associatedmemory module (e.g., 540-m 1), using a random-access read cycle; andreading also includes sending, by the specific data interface (e.g.,523-1), to the gateway compute node 500-gate, via the switching network550, using a packetized message associated with the first communicationprotocol, said one of the general communication messages 7 mes.

In a third alternative embodiment to the system 760 described above,further the first communication protocol is a layer two (L2)communication protocol, in which layer three (L3) traffic is absent fromthe memory network 760-mem-net, thereby facilitating the first latencyperformance, and the second communication protocol is a layer three (L3)communication protocol, in which layer three (L3) functionality is addedby the gateway compute element 500-gate to the general communicationmessages 7 mes, thereby facilitating the transmission 762-TR of generalcommunication messages 7 mes to those of the destinations 7DST thatrequire layer three (L3) functionality such as Internet-Protocol (IP)addressing functionality.

In a fourth alternative embodiment to the system 760 described above,further the first communication protocol does not include a transmissioncontrol protocol (TCP), thereby facilitating the first latencyperformance, and the second communication protocol includes atransmission control protocol, in which relevant handshaking is added bythe gateway compute element 500-gate in conjunction with the generalcommunication messages 7 mes when relaying the general communicationmessages to those destinations 7DST requiring a transmission controlprotocol.

In a fifth alternative embodiment to the system 760 described above,further the switching network 550 is based on Ethernet.

In one configuration of the fifth alternative embodiment just described,further the general communication network 760-gn is at least one networkof the Internet.

In a sixth alternative embodiment to the system 760 described above,further the first latency performance is a latency performance in whichthe access 512-D1-TR, 512-D2-TR of any of the compute elements 500-c 1,500-c 2 to any of the data sets 512-D1, 512-D2, 512-Dn is done in lessthan 5 (five) microseconds.

In a seventh alternative embodiment to the system described above,further the shared memory pool 512 is a key-value-store 621 (FIG. 13A),in which said plurality of data sets 512-D1, 512-D2, 512-Dn are aplurality of values 618-v 1, 618-v 2, 618-v 3 (FIG. 13A) associatedrespectively with a plurality of keys 618-k 1, 618-k 2, 618-k 3 (FIG.13A).

In one possible configuration of the seventh alternative embodiment justdescried, the system further includes a shared input-output medium 685(FIG. 13A) associated with a medium controller 685-mc (FIG. 13A), inwhich both the shared input-output medium 685 (FIG. 13A) and the mediumcontroller 685-mc (FIG. 13A) are associated with one of the computeelements 500-c 1 (interchangeable with the compute element 600-c 1illustrated in FIG. 13A). Further, the access 512-D1-TR, 512-D2-TR is ahigh priority key-value transaction 681-kv-tran (FIG. 13A). Further, oneof the compute elements (e.g., 500-c 1), in conjunction with the firstcommunication protocol, is configured to initiate the high prioritykey-value transaction 681-kv-tran (FIG. 13A) in conjunction with thekey-value-store 621 (FIG. 13A) via the shared input-output medium 685(FIG. 13A). Further, the medium controller 685-mc (FIG. 13A), inconjunction with the first communication protocol, is configured toblock lower priority transactions 686-tran (FIG. 13A) via the sharedinput-output medium 685 (FIG. 13A) during at least parts of the highpriority key-value transactions 681-kv-tran (FIG. 13A), therebypreventing delays in the access 512-D1-TR, 512-D2-TR, thereby furtherfacilitating said first latency performance.

In a possible variation of the possible configuration just described,further, the shared input-output medium 685 (FIG. 13A) is the switchingnetwork 550.

In an eighth alternative embodiment to the system described above,further the obtaining 761-obt includes sending by the compute elements500-c 1, 500-c 2 the general communication messages 7 mes to the gatewaycompute node 500-gate using a packetized transmission associated withthe first communication protocol directly via the switching network 550.

In a ninth alternative embodiment to the system 760 described above, thesystem 760 further includes a first server 560-S-1, a second server560-S-2, and a third server 560-S-3. Further, at least one of thecompute nodes 500-c 1, 500-c 2 is located in the first server 560-S-1,at least a part of the shared memory pool 512 (such as a memory module540-m 1) is located inside the second server 560-S-2, the gatewaycompute node 500-gate is located inside the third server 560-S-3, andthe switching network 550 is located outside the first, second, andthird servers. In this ninth alternative embodiment, the memory network760-mem-net facilitates memory disaggregation in the system 760.

FIG. 23A illustrates one embodiment of a method for facilitating generalcommunication via a switching network 550 currently transporting aplurality of data elements associated with a plurality of memorytransactions. In step 1111, a plurality of data sets 512-D1, 512-D2,512-Dn associated with a plurality of memory transactions 512-D1-TR,512-D2-TR that are latency critical, are transported, via a switchingnetwork 550, using a first communication protocol adapted for lowlatency transmissions, between a first plurality of compute elements500-c 1, 500-c 2 and a plurality of memory modules 540-m 1, 540-m 2,540-mk In step 1112, a plurality of general communication messages 7 mesare sent 761-obt, via the switching network 550, by the plurality ofcompute elements 500-c 1, 500-c 2, respectively, to a gateway computenode 500-gate, using the first communication protocol or anothercommunication protocol adapted for low latency transmissions, therebykeeping the switching network 550 in condition to continue facilitatingthe plurality of memory transactions 512-D1-TR, 512-D2-TR. In step 1113,the plurality of general communication messages 7 mes are communicated,via a general communication network 760-gn, using a second communicationprotocol adapted for the general communication network 760-gn, by thegateway compute node 500-gate, on behalf of the plurality of computeelements 500-c 1, 500-c 2, to a plurality of external destinations 7DST.

FIG. 23B illustrates an alternative embodiment of a method forfacilitating general communication via a switching network 550 currentlytransporting a plurality of data elements associated with a plurality ofmemory transactions. In step 1121, a plurality of data sets 512-D1,512-D2, 512-Dn associated with a plurality of memory transactions512-D1-TR, 512-D2-TR are transported, via a switching network 550, usinga first communication protocol adapted for said switching network 550,between a first plurality of compute elements 500-c 1, 500-c 2 and aplurality of memory modules 540-m 1, 540-m 2, 540-mk In step 1122, aplurality of communication tunnels respectively between said pluralityof compute elements 500-c 1, 500-c 2 and a gateway compute node 500-gateare sustained, using the first communication protocol or anothercommunication protocol adapted for the switching network 550, via theswitching network 550. In step 1123, the plurality of tunnels is used bythe plurality of compute elements 500-c 1, 500-c 2 to send a pluralityof general communication messages 7 mes to the gateway compute node500-gate. In step 1124, the plurality of general communication messages7 mes are communicated 762-TR, via a general communication network760-gn, using a second communication protocol adapted for the generalcommunication network 760-gn, by the gateway compute node 500-gate, onbehalf of the plurality of compute elements 500-c 1, 500-c 2, to aplurality of external destinations 7DST.

FIG. 24A illustrates one embodiment of a first system 780 configured togenerate automatically a procedure to effectively combine fetching andprocessing of data sets. The system 780 includes a first database 781-DBstoring a code sequence 7-code describing an action to be performed by atarget system 780-target separate from the first system 780. Such codesequence 7-code is converted by a first compute element 780-c 1 intomachine executable instructions 7-exe including a fetching sequence7-fetch to be executed by the target system 780-target. According to theconverted machine executable instructions 7-exe, a second computeelement 780-c 2 located in the target system 780-c 2, will fetch thedata set from a data source 782-data located in the target system780-target, and then process such data set. The fetching-and-processingprocedure to be executed by the second compute element 780-c 2 isoperative to fetch, by the second compute element 780-c 2, from the datasource 782-data, using the fetching sequence 7-fetch, a first data set512-D1 belonging to the plurality of data sets. The fetch-and-processingprocedure is operative also to conclude, by the second compute element780-c 2, that the first data set 512-D1 has not yet been received in thesecond compute element 780-c 2 due to a first latency associated withthe fetch. Therefore, in order to not lose time, and instead ofprocessing the first data set 512-D1 that is not yet available to thesecond compute element, the second compute element 780-c 2 fetches fromthe data source 782-data a second data set 512-D2 belonging to theplurality of data sets. The fetch-and-processing procedure is operativealso to process, by the second compute element 780-c 2, the first dataset 512-D1 after such first data set 512-D1 has been received by thesecond compute element 780-c 2 from the data source 782-data. Asdescribed herein the code sequence 7-code might be a source code, ahigh-level computer language code, or other data bits that are notimmediately executable by a data processor until the code sequence7-code has been converted into executable machine language.

FIG. 24B illustrates one embodiment of a second compute element 780-c 2operative to fetch and process data sets 512-D1, 512-D2 according to themachine executable instructions 7-exe, including a depiction of therequests for data sets and the reception of data sets. The secondcompute element 780-c 2, according to the machine executableinstructions 7-exe, initiates a process to fetch 78-fetch-1 a first dataset 512-D1 stored in the data source 782-data by sending a request todata source 782-data. There will be a latency associated with thereceipt 78R1 by the second compute element 780-c 2 of the first data set512-1. During this latency, and in order not to lose time, the secondcompute element 780-c 2, according to the machine executableinstructions 7-exe, initiates another process to fetch 78-fetch-2 asecond data set 512-D2 stored in the data source 782-data by sendinganother request to the data source 782-data. The first data set 512-D1is then received 78R1 from data source 782-data in the second computeelement 780-c 2. The second compute element 780-c 2, after it hasreceived 78R1 the first data set 512-D1, processes ‘780-p 1 this firstdata set 512-D1. Thereafter, the second compute element 780-c 2 receives78R2 the second data set 512-D2, and afterwards processes 780-p 2 thesecond data set 512-D2, all according to the machine executableinstructions 7-exe.

FIG. 24C illustrates one embodiment of a system 780′ configured togenerate automatically a procedure to effectively combine fetching andprocessing of data sets, in which executable instructions are executedimmediately upon their receipt by an executing compute element 780-c 2.This system includes (i) a first database 781-DB configured to store anexecutable code 7-code, (ii) a first compute element 780-c 1 configuredto convert the executable code 7-code into a sequence of machineexecutable instructions 7-exe and communicate 78-com the convertedmachine executable instructions 7-exe to a second compute element 780-c2, and (iii) a target system 780-target including a data source 782-datastoring a plurality of data sets 512-D1, 512-D2, and a second computeelement 780-c 2 configured to execute a fetch-and-processing procedure.The structure of the system 780′ illustrated in FIG. 24C is the same asthe system 780 illustrated in FIG. 24A, except that the system 780′ inFIG. 24C includes also, within the overall system 780′, the targetsystem 780-target. The system 780′ in FIG. 24C operates in a mannersimilar to the system 780 and target system 780-target in FIG. 24A,except that in the system 780′ of FIG. 24C the first compute element780-c 1 communicates 78-com the sequence of executable instructions7-exe to the second compute element 780-c 2 just before the secondcompute element 780-c 2 starts executing the sequence of executableinstructions 7-exe in the sequence illustrated in FIG. 24B as78-fetch-1, 78-fetch-2, 78R1, 780-p 1, 78R2, and 780-p 2. Hence, boththe structure and the execution of the embodiment illustrated in FIG.24C are different than the structure and the execution of the embodimentillustrated in FIG. 24A.

One embodiment is a system 780 configured to generate automatically aprocedure operative to effectively combine fetching and processing ofdata sets. In a particular embodiment, a first database 781-DB isconfigured to store a code sequence 7-code describing an action to beperformed by a target system 780-target on each of a plurality of datasets 512-D1, 512-D2, in which the action for each of the plurality ofdata sets comprises (i) fetching the data set from a data source782-data in the target system 780-target, and (ii) processing the dataset fetched. Further, a first compute element 780-c 1 has access to thefirst database 781-DB, and is configured to convert the code sequence7-code into a sequence of executable instructions 7-exe includes afetching sequence 7-fetch, in which the sequence of executableinstructions 7-exe, when executed by a second compute element 780-c 2 ofthe target system 780-target, results in a fetching-and-processingprocedure. Further, the fetching-and-processing procedure is operativeto fetch 78-fetch-1 from the data source 782-data, using said fetchingsequence 7-fetch, a first data set 512-D1 belonging to the plurality ofdata sets. The fetching-and-processing procedure is further operative toconclude that the first data set 512-D1 has not yet been received 78R1in the second compute element 780-c 2 due to a first latency associatedwith the fetch 78-fetch-1, and therefore, in order to not lose time, andinstead of processing 780-p 1 the first data set 512-D1, to fetch78-fetch-2 from the data source 782-data a second data set 512-D2belonging to the plurality of data sets. The fetching-and-processingprocedure is further configured to process 780-p 1 the first data set512-D1 after the first data set 512-D1 has been received 78R1 by thesecond compute element 780-c 2.

In a first alternative embodiment to the system just described, thefetching-and-processing procedure is further operative to process 780-p2 the second data set 512-D2 after it has been received by the secondcompute element 780-c 2.

In a possible configuration of the first alternative embodiment justdescribed, the fetching-and-processing procedure is further operative toperform a sequence of additional fetches of additional ones of theplurality of data sets, until all of the data sets have been fetched. Inone embodiment of this possible configuration, the additional fetchesare done regardless of and asynchronously with reception of theadditional ones of the plurality of data sets.

In one possible variation of the possible configuration just described,the fetching-and-processing procedure is further operative to processeach of such additional ones of the plurality of data sets as they arereceived, until all of said data sets have been processed.

In a second alternative embodiment to the system described above togenerate automatically a procedure operative to effectively combinefetching and processing of data sets, the system 780 (from FIG. 24A)further includes the target system 780-target and thus becomes a newsystem 780′ (from FIG. 24B).

In a first possible configuration of the second alternative embodimentjust described, further the conversion is performed by the first computeelement 780-c 1 just before the second compute element 780-c 2 startsexecuting the sequence of machine executable instructions 7-exe.

In a possible variation of the first possible configuration of thesecond alternative embodiment just described, further the first computeelement 780-c 1 communicates 78-com the sequence of machine executableinstructions 7-exe to the second compute element 780-c 2 just before thesecond compute element 780-c 2 starts executing the sequence of machineexecutable instructions 7-exe.

In a second possible configuration of the second alternative embodimentpreviously described, further the first compute element 780-c 1 and thesecond compute element 780-c 2 are a single compute element.

In a third alternative embodiment to the system described to generateautomatically a procedure operative to effectively combine fetching andprocessing of data sets, further the code sequence 7-code is written ina high-level programming language, and the conversion of the codesequence 7-code into machine executable instructions 7-exe is acompilation process.

One embodiment is a system 780′ configured to combine effectivelyfetching and processing of data sets according to an automaticallygenerated procedure. In a particular embodiment, the system includes adata source 782-data configured to produce, store, or obtain a pluralityof data sets 512-D1, 512-D2, a first compute element 780-c 1, and asecond compute element 780-c 2 communicatively connected with said thesource 782-data. The system also includes a code sequence 7-codedescribing an action to be performed on each of the plurality of datasets 512-D1, 512-D2, in which the action for each of the plurality ofdata sets comprises: (i) fetching the data set from the data source782-data, and (ii) processing the data set fetched. Further, the firstcompute element 780-c 1 is configured to convert the code sequence7-code into a sequence of machine executable instructions 7-exeincluding a fetching sequence 7-fetch in which the sequence of machineexecutable instructions 7-exe, when executed by the second computeelement 780-c 2, results in a procedure that combines effectively thefetching of the data sets and the processing of the data sets. Further,the second compute element 780-c 2 is configured to receive 78-com andexecute the sequence of machine executable instructions 7-exe, therebyimplementing the procedure for fetching and processing data sets.Further, the fetching-and-processing procedure is operative to fetch78-fetch-1 from the data source 782-data, using the fetching sequence7-fetch, a first data set 512-D1 belonging to the plurality of datasets. The fetching-and-processing procedure is further operative toconclude that the first data set 512-D1 has not yet been received 78R1in the second compute element 780-c 2 due to a first latency associatedwith the fetch 78-fetch-1, therefore, in order to not lose time, andinstead of processing 780-p 1 the first data set 512-D1, to fetch78-fetch-2 from the data source 782-data a second data set 512-D2belonging to the plurality of data sets. The fetching-and-processingprocedure is further operative to process 780-p 1 the first data set512-D1 after it has been received 78R1 by the second compute element780-c 2.

In a first alternative embodiment to the system just described, thesystem further includes a switching network 550 (FIG. 10B), and the datasource 782-data is a data interface 523-1, 523-2, 523-k (FIG. 10B)associated with a shared memory pool 512 (FIG. 10B), in which the datainterface is communicatively connected with the second compute element780-c 2 via the switching network 550 (FIG. 10B). In this embodiment,the second compute element 780-c 2 is interchangeable with the pluralityof compute elements 500-c 1, 500-c 2, 500-cn illustrated in FIG. 10B.

In one possible configuration of the first alternative embodiment justdescribed, further the plurality of data sets 512-D1, 512-D2 is aplurality of values 618-v 1, 618-v 2 (FIG. 11A) associated respectivelywith a plurality of keys 618-k 1, 618-k 2 (FIG. 11A). In thisembodiment, the switching network illustrated as element 550 in FIG. 10Bis interchangeable with the switching network illustrated as element 650in FIG. 11A. Further, it should be understood that the key value systemdepicted as element 621 in FIG. 11A may be implemented, in someembodiments, using the shared memory pool illustrated as element 512 inFIG. 10B. In this sense the key value system 621 and the shared memorypool 512 may be considered interchangeable in the context of the datasets represented by the values associated with the keys in the key valuesystem.

In one possible variation of the first possible configuration justdescribed, further the fetching sequence 7-fetch is operative to send tothe data interface 523-1, 523-2, 523-k (FIG. 10B), via the switchingnetwork 650 (FIG. 11A), one of the keys 618-k 1 (FIG. 11A) in theplurality of keys 618-k 1, 618-k 2, 618-k 3, thereby allowing the datainterface to find one of the values 618-v 1 (FIG. 11A) in the pluralityof values 618-v 1, 618-v 2, 618-v 3 that is associated with the one ofthe keys sent. The fetching sequence 7-fetch is further operative toreceive from the data interface 523-1, 523-2, 523-k 3, via the switchingnetwork 650, the one of the values found 618-v 1.

In one possible option to the possible variation just described, furtherthe first latency is associated with a time required for one ofplurality of keys 618-k 1, 618-k 2, 618-k 3 to arrive at the datainterface 523-1, 523-2, 523-k. The first latency is further associatedwith a time required for finding the one of the values 618-v 1. Thefirst latency is further associated with the time required for thereception by the second compute element 780-c 2 of the one of the values618-v 1.

In a second alternative embodiment to the system described above that isconfigured to combine effectively fetching and processing of data setsaccording to an automatically generated procedure, further the datasource 782-data is a shared input-output medium 685 (FIG. 13A). Further,the fetching 78-fetch-1, 78-fetch-2 in conjunction with the data sets512-D1, 512-D2, is associated with a memory transaction or a key-valuetransaction 681-kv-tran (FIG. 13A) conveyed via the shared input-outputmedium 685 (FIG. 13A).

In a first possible configuration of the second alternative embodimentjust described, further the first latency is associated with a delay inthe fetching 78-fetch-1, 78-fetch-2 resulting from any generalcommunication transaction 686-tran (FIG. 13A) conveyed via the sharedinput-output medium 685 (FIG. 13A).

In a second possible configuration of the second alternative embodimentdescribed above, further the shared input-output medium 685 (FIG. 13A)is based on an interconnect element selected from a group consisting of:(i) peripheral-component-interconnect-express (PCIE) computer expansionbus, (ii) Ethernet, and (iii) Infiniband.

FIG. 25 illustrates one embodiment of a method for generating a sequenceof executable instructions operative to combine effecting fetching andprocessing of data sets. In step 1131, a first compute element 780-c 1receives a code sequence 7-code describing an action to be performed oneach of a plurality of data sets 512-D1, 512-D2, in which the action foreach of the plurality of data sets comprises: (i) fetching the data setfrom a data source 782-data, and (ii) processing the data set fetched.In step 1132, the first compute element 780-c 1 identifies, in the codesequence 7-code: a first code component describing the fetching (forexample, a “get” instruction, or an equation having an argument thatneeds to be fetched from somewhere), and a second code component 780-c 2describing the processing to be done in conjunction with each data setfetched (for example, a mathematical expression acting on the argument).In step 1133, the first compute element 780-c 1 selects, based on (i)the identification, and on (ii) at least a first characteristic of thedata sets 512-D1, 512-D2, a fetching sequence suitable for the fetching.As just one example, if the data sets are key-value pairs, then afetching of a value using a key is used. In step 1134, the first computeelement converts the code sequence 7-code into a sequence of machineexecutable instructions 7-exe including at least one instance of thefetching sequence selected 7-fetch, in which the sequence of machineexecutable instructions 7-exe, when executed, results in afetching-and-processing procedure. Further, the fetching-and-processingprocedure is operative to have a second compute element 780-c 1 fetch78-fetch-1, from the data source 782-data, using the fetching sequence7-fetch, a first data set 512-D1 belonging to the plurality of data sets512-D1, 512-D2. The fetching-and-processing procedure is furtheroperative to have the second compute element 780-c 2 conclude that thefirst data set 512-D1 has not yet been received 78R1 in the secondcompute element 780-c 2 due to a first latency associated with the fetch78-fetch-1. Therefore, in order to not lose time, and instead ofprocessing 780-p 1 the first data set 512-D1, the procedure is operativeto have the second compute element 780-c 2 fetch 78-fetch-2 from thedata source 782-data a second data set 512-D2 belonging to the pluralityof data sets 512-D1, 512-D2. The fetching-and-processing procedure isfurther operative to have the second compute element 780-c 2 process thefirst data set 512-D1 after it has been received 78R1 by the secondcompute element 780-c 2.

In a first alternative embodiment to the method just described, furtherthe second compute element's 780-c 2 conclusion that the first data set512-D1 has not yet been received 78R1 in the second compute element780-c 2 is a default condition when no interrupt associated withreception of the first data set 512-D1 has been detected by the secondcompute element 780-c 2, thereby indicating to the second computeelement 780-c 2 that the first data set 512-D1 is not yet ready forprocessing by the second compute element 780-c 2, thereby facilitatingthe fetching 78-fetch-2 of the second data set 512-D2 by the secondcompute element 780-c 2.

In one configuration of the first alternative embodiment just described,further the second compute element's 780-c 2 conclusion that the firstdata set 512-D1 has not yet been received 78R1 in the second computeelement 780-c 2 is a passive conclusion in which the fetching 78-fetch-2of the second data set 512-D2 by the second compute element 780-c 2 isdone automatically unless interrupted by the interrupt.

In a second alternative embodiment to the method described above forgenerating a sequence of executable instructions operative to combineeffecting fetching and processing of data sets, further the secondcompute element's 780-c 2 conclusion that the first data set 512-D1 hasnot yet been received 78R1 in the second compute element 780-c 2 isreached by second compute element's 780-c 2 actively checking forreception 78R1 of the first data set 512-D1 by the second computeelement 780-c 2.

In a third alternative embodiment to the method described above forgenerating a sequence of executable instructions operative to combineeffecting fetching and processing of data sets, further the codesequence 7-code is a loop in which each iteration of the loop describesan action to be performed on one of the data sets (for example, on thefirst data set 512-D1) of the plurality of data sets 512-D1, 512-D2having an index associated with the iteration.

In a fourth alternative embodiment to the method described above forgenerating a sequence of executable instructions operative to combineeffecting fetching and processing of data sets, further the codesequence 7-code describes a single instruction to be performed onmultiple data, in which the single instruction is associated with theprocessing and the multiple data are associated with the plurality ofdata sets 512-D1, 512-D2. In some embodiments, the single instruction tobe performed on multiple data is an SIMD instruction.

One embodiment is a system 780 configured to generate automatically aprocedure operative to effectively combine fetching and processing ofdata sets. In a particular embodiment, a first database 781-DB isconfigured to store a code sequence 7-code describing an action to beperformed by a target system 780-target on each of a plurality of datasets 512-D1, 512-D2, in which the action per each of the plurality ofdata sets comprises: (i) fetching the data set from a data source782-data in the target system 780-target, and (ii) processing said dataset fetched. Further, a first compute element 780-c 1, having access tosaid first database 781-DB, is configured to convert the code sequence7-code into a sequence of executable instructions 7-exe comprising afetching sequence 7-fetch, in which said sequence of executableinstructions 7-exe, when executed by a second compute element 780-c 2 ofthe target system 780-target, results in a fetching-and-processingprocedure. Further, the fetching-and-processing procedure is operativeto fetch 78-fetch-1 from the data source 782-data, using said fetchingsequence 7-fetch, a first data set 512-D1 belonging to the plurality ofdata sets. The fetching-and-processing procedure is further operative toinitiate a second fetch 78-fetch-2 from the data source 782-data, usingsaid fetching sequence 7-fetch, for a second data set 512-D2 belongingto the plurality of data sets, in which the initiation is done prior toprocessing 780-p 1 of the first data set 512-D1 that has not yet beenreceived 78R1 in said second compute element 780-c 2 due to a firstlatency associated with the fetching 78-fetch-1 of the first data set512-D1. The fetching-and-processing procedure is further configured toprocess 780-p 1 the first data set 512-D1 after the first data set512-D1 has been received 78R1 by the second compute element 780-c 2.

FIG. 26 illustrates one embodiment of a system 790 using a plurality oflinked lists for keeping track of changes to be made in data setscurrently stored in a flash memory. As shown in FIG. 26, the system 790includes a first server 790-S-1 that includes a first compute element700-c 1, and a first random access memory 791-RAM. In some embodiments,the first compute element 700-c 1 includes a data set 792-D1-u that hasbeen updated using some aggregated change requirements, and an updatedfirst data 7 d 1′ which has been extracted by the first compute element700-c 1 from the updated data set 792-D1-u. In some embodiments, thefirst compute element 700-c 1 includes also a plurality of changes to bemade to a particular data set, where such changes have been accumulatedinto an aggregated requirement 792-D1-12, which might be the particularaggregated change requirements that is used to create the updated dataset 792-D1-u. In some embodiments, the first server 790-S-1 includes anadditional compute element 700-cn, and further there may be three ormore compute elements within the first server 790-S-1.

As shown in FIG. 26, the first server 790-S-1 includes also a randomaccess memory 791-RAM, which itself includes multiple changerequirements each of which relates to a particular data set with amemory block of a flash memory 792-flash. The various changerequirements are accumulated in the random access memory 791-RAM in theorder in which they are received, such that requirement 792-D1-r 1 isreceived before 792-D1-r 2, which is received before 792-D1-r 3. Thesethree change requirements all relate to a first data set 792-D1 in afirst memory block 792-B1 within the flash memory 792-flash. However,the receipt of change requirements for a single data set will almostcertainly be interspersed with other change requirements related todifferent data sets. As shown in FIG. 26, change requirement 792-D1-r 1related to data set 792-D1 is received first, then change requirement792-D2-r 1 related to data set 792-D2 in second memory block 792-B2,then change requirement 792-D1-r 2 related to the first data set 792-D1,then 792-D2-r 2 related to the second data set 792-D2, and finallychange requirement 792-D1-r 3 related to the first data set 792-D1.

The change requirements in random access memory 791-RAM are executableas data entries, where change requirement 792-D1-r 1 is executable asdata entry 792-D1-e 1, then 792-D2-r 1 as 792-D2-e 1, 792-D1-r 2 as792-D1-e 2, 792-D2-r 2 as 792-D2-e 2, and 792-D1-r 3 as 792-D1-e 3.However, in order to perform the execution of changes, each executabledata entry related to a particular data set is linked as part of alinked list from an earlier data entry to a later data entry. As shownin FIG. 26, a first linked list 7LL-B1, represented by a boldfaced linesegment to the left of 791-RAM, links a first executable data entry792-D1-e 1 related to a first data set 792-D1 to a second executabledata entry 792-D1-e 2 related to the first data set 792-D1, and also thesecond executable data entry 792-D1-e 3 to a third executable data entry792-D1-e 3 related to the first data set 792-D1. In the embodimentillustrated in FIG. 26, the linkages are made through pointers. So, forexample, 792-D1-e 1 has pointer 7 pt 1 which points at the physicaladdress for 792-D1-e 2, and 792-D1-e 2 has pointer 7 pt 2 which pointsat the physical address for 792-D1-e 3. In this way, all of theexecutable data entries for a specific data set are linked, and all ofthe data entries may be executed when the memory block holding thespecific data set is rewritten. For example, all of the data entries forthe first data set 792-D1 are executed when the first memory block792-B1 is rewritten.

Similarly, a second linked list 7LL-B2 shown in FIG. 26 links all of theexecutable data entries related to the second data set 792-D2. Inparticular, executable data entry 792-D2-e 1 related to the second dataset 792-D2 is linked via pointer 7 pt 1′ to executable entry 792-D2-e 2also related to the second data set 792-D2. When sufficient changes forthe second data set 792-D2 have been accumulated, the second data block792-B2 is rewritten with all of these changes. Second linked list 7LL-B2is illustrated by the dotted line segment to the right of 791-RAM,connecting the dotted-line boxes with the executable data entries792-D2-e 1 and 792-D2-e 2 for the second data set 792-D2.

It should be noted that the last entry illustrated for the first dataset 792-D1, which is entry 792-D1-e 3, does not have a pointer, and thereason is that there is nothing to point to, because this is the lastentry for that data set. If, at some time, a fourth change request ismade for the first data set 792-D1, then that fourth change request willgenerate a fourth executable data entry, at which time a pointer will beadded from the third entry 792-D1-e 3 to the new fourth executable dataentry. Similarly, there is no pointer for executable data entry 792-D2-e2 related to the second data set 792-D2, because this is the lastexecutable data entry for the second data set 792-D2, but if, at sometime, a third change request is made for second data set 792-D2, thenthat third change request will generate a third executable data entry,at which time a pointer will be added from the second entry 792-D2-e 2to the new third executable data entry.

The system 790 illustrated in FIG. 26 includes a flash memory 792-flash,which includes multiple memory blocks 792-B1, 792-B2. As shown, firstmemory block 792-B1, delineated by a boldfaced rectangle, includes afirst data set 792-D1, whereas second memory block 792-B2, delineated bya rectangle created by a dotted line, includes a second data set 792-D2.It will be understood that there may be thousands, millions, or evenbillions of memory blocks with the flash memory 792-flash, and that eachmemory block will hold one or more specific data sets. Also,periodically the flash memory 792-flash receives a request to read somedata held in the flash memory. For example, as shown in FIG. 26, arequest has been received to read some piece of data 7 d 1 of the firstdata set 792-D1 stored in the first memory block 792-B1. In response tosuch request, the first data set 792-D1 is sent to the requestingcompute element 700-c 1, which uses the aggregated change requirements792-D1-12 to update the first data set 792-D1 into an updated data set792-D1-u, which then extracts the required data 7 d 1′ from the updateddata set 792-D1-u. It will be understood that the extracted first data 7d 1′ may or may not be identical to the original data requested 7 d 1.If the aggregated change requirements 792-D1-12 do not impact thespecific data requested by the first compute element 700-c 1, then theoriginal requested data 7 d 1 and the extracted data after update 7 d 1′will be exactly the same. If on the other hand, the aggregated changerequirements 792-D1-12 do impact the specific data requested by thefirst compute element 700-c 1, then the original requested data 7 d 1will be different from the extracted data after updated 7 d 1′, wherethe first compute element 700-c 1 wishes to read and does read theupdated data 7 d 1′.

As illustrated in FIG. 26, the system 790 includes also a second computeelement 700-c 2, which executes many of the actions further describedherein.

The embodiment illustrated in FIG. 26 is illustrative only andnon-limiting, in that alternative structures could achieve the same orsimilar effects. In alternative embodiments, there may be multipleservers. For example, a first server may include only compute elements700-c 1 and 700-cn, whereas a second server may include the randomaccess memory 791-RAM, a third server may include the flash memory792-flash, and a fourth memory may include a second compute element700-c 2. As a different example, the first server 790-S-1 may include,in addition to the compute elements 700-c 1, 700-cn and random accessmemory 791-RAM as shown, also the flash memory 792-flash. As a differentexample, the first server 790-S-1 may include only the compute elements700-c 1, 700-cn, whereas a second server could include the random accessmemory 791-RAM and the flash memory 792-flash. Many differentembodiments are conceivable, in which one or more servers includevarious ones of the compute elements 700-c 1, 700-c 2, 700-cn, therandom access memory 791-RAM, and the flash memory 792-flash. Thevarious alternative structures of the system 790 may also be used toimplement the various methods described below.

The embodiment illustrated in FIG. 26 is illustrative and non-limiting,in that alternative pieces of hardware may execute some of the functionsdescribed above as being executed by some exemplary piece of hardware.For example, as described above, the first compute element 700-c 1identifies linked lists, traverses linked lists to accumulate changerequirements, makes requests to change a data set, updates a data set,and responds to requests by extracting data from an updated data set.Different ones of these functions may be executed by different hardware,so for example, one compute element might identify, traverse, and makerequests, but a separate compute element might update data sets andrespond to requests by extracting data. As another example, FIG. 26shows a single compute element 700-c 2 executing functions in the flashmemory 792-flash, but these functions may be executed by multiplecompute elements.

One embodiment is a system 790 operative to use a plurality of linkedlists 7LL-B1, 7LL-B2 for keeping track of changes to be made in datasets currently stored in a flash memory 792-flash. In one particularembodiment, the system 790 includes a first compute element 700-c 1, anda first flash memory 792-flash comprising a plurality of blocks 792-B1,792-B2 currently storing respectively a plurality of data sets 792-D1,792-D2. The system further includes a first random access memory 791-RAMcomprising a plurality of linked lists 7LL-B1, 7LL-B2 associatedrespectively with the plurality of blocks 792-B1, 792-B2, in which eachlinked list (for example, 7LL-B1) records a respective plurality ofrequirements 792-D1-r 1, 792-D1-r 2 to change the data set 792-D1 of therespective block 792-B1, and in which the plurality of requirements792-D1-r 1, 792-D1-r 2 were made by the first compute element 700-c 1and have been accumulated 792-D1-e 1, 792-D1-e 2 in the linked list7LL-B1 since the data set 792-D1 was last written to the respectiveblock 792-B1. Further, the system 790 is configured to identify one ofthe linked lists (such as 7LL-B1) as being currently in condition to beused for updating the respective block 792-B1. The system 790 is furtherconfigured to traverse the linked list 7LL-B1 identified in order toaccumulate all the respective plurality of requirements 792-D1-r 1,792-D1-r 2 into an aggregated requirement 792-D1-12 to change the dataset 792-D1 of the respective block 792-B1. The system is furtherconfigured to change the data set 792-D1 of the respective block 792-B1by performing a flash block write to the respective block 792-B1 inconjunction with the aggregated requirement 792-D1-12.

In a first possible alternative to the system just described, furthereach of the linked lists (such as 7LL-B1) comprises a plurality of dataentries 792-D1-e 1, 792-D1-e 2 associated respectively with theplurality of requirements 792-D1-r 1, 792-D1-r 2, in which each of thedata entries (e.g. 792-D1-e 1) is linked to the next data entry 792-D1-e2 using a pointer 7 pt 1 to an address associated with the next suchdata entry 792-D1-e 2, except that the most recent data entry does notyet have a pointer because it has no subsequent data entry to point to.

In a first possible configuration to the first possible alternative justdescribed, further the traversing of the linked list 7LL-B1 is done byperforming a random access read cycle to each of the data entries (forexample, to 792-D1-e 2) in the linked list using the addresses asreferenced by the pointers 7 pt 1, 7 pt 2. As an example, pointer 7 pt 1stores the address associated with data entry 792-D1-e 2, such that dataentry 792-D1-e 2 can be randomly accessed using the address stored inpointer 7 pt 1. Entry 792-D1-e 1 can be randomly accessed using anaddress stored in a “head” pointer (not depicted) associated with block792-B1, in which such a head pointer points to the beginning of thelinked list 7LL-B1 and is thus used to start such traversing of thelinked list 7LL-B1.

In a second possible configuration to the first possible alternativedescribed above, further all the pluralities of data entries (asillustrated in FIG. 26, first plurality 792-D1-e 1, 792-D1-e 2, 792-D1-e3 and second plurality 792-D2-e 1, 792-D2-e 2) are stored in a singlememory space (for example, a successive series of addresses) within thefirst random access memory 791-RAM, thereby resulting is the pluralityof linked lists 7LL-B1, 7LL-B2 being interlaced across the single memoryspace, but such that the traversing is possible for each of the linkedlists using the pointers (for example, 7 pt 1 and 7 pt 2 for linked list7LL-B1).

In a second possible alternative to the system for using a plurality oflinked lists as described above, further identification of one of thelinked lists 7LL-B1, 7LL-B2 as being currently in condition to be usedfor updated its respective block is based on the number of requirementsin the plurality of requirements.

In one possible configuration of the second possible alternative justdescribed, further the linked list that is identified is the linked listassociated with the highest number of requirements, as compared with theother linked lists.

In a third possible alternative to the system for using a plurality oflinked lists as described above, further each of the plurality ofrequirements (for example, 792-D1-r 1, 792-D1-r 2, 792-D1-r 3 for afirst data set 792-D1) is stored in the respective linked list (in thiscase, first linked list 7LL-B1) as part of a sequence of new data to bewritten to specific address in the respective block 792-B1.

In one possible configuration of the third possible alternative justdescribed, further the identification is based on the length of thesequences of new data, such that the identification is made when thesequence of new data exceeds a certain threshold length.

In a fourth possible alternative to the system for using a plurality oflinked lists as described above, the system 790 further comprisesadditional compute elements 700-cn, each of which is operative to makeadditional requirements to change the data set of at least some of theblocks, and in which each such additional compute element necessitatesan additional plurality of linked lists in support of the additionalrequirements, thereby resulting is several pluralities of linked lists.Further, the first random access memory is a shared memory pool (512 inFIG. 10B) which is large enough to store the several pluralities oflinked lists.

In a fifth possible alternative to the system for using a plurality oflinked lists as described above, the system 790 further comprises asecond compute element 700-c 2 associated with the first flash memory792-flash, and a switching network (550 in FIG. 10B). Further, the firstrandom access memory 791-RAM is located in a first server 790-S-1together with the first compute element 700-c 1. Further, the firstcompute element 700-c 1 is configured to perform the identification,traversing, and accumulation in conjunction with the first random accessmemory 791-RAM. Further, the first compute element 700-c 1 isadditionally configured to send the aggregated requirement 792-D1-12accumulated to the second compute element 700-c 2 via said switchingnetwork (550 in FIG. 10B). Further, the second compute element 700-c 2is configured to receive the aggregated requirement 792-D1-12 andperform the changing using the aggregated requirement received.

In a sixth possible alternative to the system for using a plurality oflinked lists as described above, the system 790 further comprisesadditional compute elements 700-cn, in which the first requirement792-D1-r 1 is made by the first compute element 700-c 1, and the secondrequirement 792-D1-r 2 is made by one of the additional compute elements700-cn, such that the link list 7LL-B1 aggregates requirements frommultiple sources.

One embodiment is a system 790 operative to use a plurality of linkedlists for keeping track of changes to be made in data sets currentlystored in a flash memory 792-flash. In one particular embodiment, thesystem includes a first compute element 700-c 1, and a first flashmemory 792-flash comprising a plurality of blocks 792-B1, 792-B2currently storing respectively a plurality of data sets 792-D1, 792-D2.The system 790 further includes a first random access memory 791-RAMcomprising a plurality of linked lists 7LL-B1, 7LL-B2 associatedrespectively with the plurality of blocks 792-B1, 792-B2, in which eachlinked list (for example, first linked list 7LL-B1) records a respectiveplurality of requirements (for first linked list 7LL-B1, therequirements 792-D1-r 1, 792-D1-r 2) to change the data set 792-D1 ofthe respective block 792-B1, in which the plurality of requirements792-D1-r 1, 792-D1-r 2 were made by the first compute element 700-c 1and have been accumulated 792-D1-e 1, 792-D1-e 2 in the linked list7LL-B1 since the data set 792-D1 was last written to the respectiveblock 792-B1. Further, the first compute element 700-c 1 is configuredto make a new requirement 792-D1-r 3 to change the data set 792-D1 ofone of the blocks 792-B1. Further, the system 790 is configured to linkthe new requirement 792-D1-r 3 to the linked list 7LL-B1 associated withsaid one of the blocks 792-B1, thereby appending the new requirement792-D1-r 3 to the plurality of requirements 792-D1-r 1, 792-D1-r 2already associated with the one of the blocks 792-B1.

In a possible alternative to the system just described, further each ofthe listed links (for example, first listed link 7LL-B1) comprises aplurality of data entries 792-D1-e 1, 792-D1-e 2 associated respectivelywith the plurality of requirements 792-D1-r 1, 792-D1-r 2, in which eachof the data entries (for example, 792-D1-e 1 for change requirement792-D1-r 1) is linked to the next data entry (in this example, to792-D1-e 2) using a pointer (in this example, 7 pt 1) to an addressassociated with the next such data entry, except that the most recentdata entry does not yet have a pointer because it has no subsequent dataentry to point to. Further, the new change requirement 792-D1-r 3 isassociated with a new data entry 792-D1-e 3. Further, the linkage of thenew requirement 792-D1-r 3 to the linked list 7LL-B1 is performed by:(i) adding, in conjunction with the most recent data entry 792-D1-e 2,and using a first random access write cycle, a new pointer 7 pt 2 to anew address to be associated with the new data entry 792-D1-e 3, and(ii) adding, using a second random access write cycle, at the newaddress, the new data entry 792-D1-e 3.

In a possible configuration of the possible alternative just described,further the linkage is performed in less than one microsecond, as aresult of the first random access write cycle and the second randomaccess write cycle being both random access cycles performed inconjunction with the first random access memory 791-RAM.

In a first possible variation of the possible configuration justdescribed, further the first random access memory 791-RAM is a firstdynamic random access memory.

In a second possible variation of the possible configuration justdescribed, further the new data entry 792-D1-e 3 is less than 500 (fivehundred) bytes in length, thereby allowing low latency data writes inconjunction with small data objects such as the new data entry.

In a third possible variation of the possible configuration justdescribed, further the most recent data entry 792-D1-e 2 is locatedusing a “tail” pointer (not depicted) associated with block 792-B1, andthus preventing a need to traverse the linked list 7LL-B1 in order tolocate the most recent data entry 792-D1-e 2, thereby facilitating saidlinkage being performed in less than one microsecond.

One embodiment is a system 790 operative to use a plurality of linkedlists 7LL-B1, 7LL-B2 for keeping track of changes to be made in datasets currently stored in a flash memory. In one particular embodiment,the system includes a first compute element 700-c 1, and a first flashmemory 792-flash comprising a plurality of blocks 792-B1, 792-B2currently storing respectively a plurality of data sets 792-D1, 792-D2.The system 790 further includes a first random access memory 791-RAMcomprising a plurality of linked lists 7LL-B1, 7LL-B2 associatedrespectively with the plurality of blocks 792-B1, 792-B2, in which eachlinked list (for example, first linked list 7LL-B1) records a respectiveplurality of requirements (for first linked list 7LL-B1, requirements792-D1-r 1, 792-D1-r 2) to change the data set (in this example, firstdata set 792-D1) of the respective block (in this example, 792-B1 forfirst data set 792-D1), in which the plurality of requirements (in thisexample, 792-D1-r 1, 792-D1-r 2) were made by the first compute element700-c 1 and have been accumulated (in this example, 792-D1-e 1, 792-D1-e2) in the linked list (in this example, 7LL-B1) since the data set (inthis example, 792-D1) was last written to the respective block (in thisexample 792-B1). Further, the system 790 is configured to: (i) receive afirst request to read a first data 7 d 1 associated with the data set(in this example, first data set 792-D1) stored in one of the blocks (inthis example, 792-B1), (ii) read the data set (in this example, 792-D1)from the one of the blocks (in this example, 792-B1), and (iii) traversethe linked list (in this example, first linked list 7LL-B1) associatedwith the one of the blocks (in this example, 792-B1) in order toaccumulate all the respective plurality of change requirements (in thisexample, 792-D1-r 1, 792-D1-r 2) into an aggregated requirement792-D1-12 to change the data set (in this example, first data set792-D1) of the one of the blocks (in this example, first memory block792-B1). Further, the system 790 is configured: (i) to update the dataset read (in this example, first data set 792-D1), using the aggregatedrequirement 792-D1-12, into an updated data set 792-D1-u, and (ii)respond to the first request by extracting said first data 7 d 1′ fromthe updated data set 792-D1-u. In the embodiment herein described, it isunderstood that first data 7 d 1′ extracted may or may not be differentthan the original first data set 7 d 1, depending on whether theaggregated requirement 792-D1-12 has changed the first data 7 d 1. Ifthe aggregated requirement 792-D1-12 has changed the specific data thathas been requested, then 7 d 1′ will be different and more updated thanoriginal and not-yet-updated 7 d 1. If aggregated requirement 792-D1-12has not changed the specific data that has been requested, then 7 d 1′will be the same as 7 d 1, since the original data would not be changedby a rewrite of the memory block in which the original data 7 d 1 islocated.

FIG. 27 illustrates one embodiment of a method for using as plurality oflinked lists for keeping track of changes to be made in data sets storedin a flash memory. In step 1141, a system 790 records, in a first randomaccess memory 791-RAM, a plurality of linked lists 7LL-B1, 7LL-B2associated respectively with a plurality of blocks 792-B1, 792-B2 of afirst flash memory 792-flash, in which each linked list (e.g. 7LL-B1) isa record of a respective plurality of requirements 792-D1-r 1, 792-D1-r2 to change a data set 792-D1 associated with the respective block792-B1. In step 1142, the system 790 identifies one of the linked lists(such as, for example 7LL-B1) as being in condition to be used forupdating the respective block (such as block 792-B1). In step 1143, thesystem 790 traverses the linked list identified 7LL-B1 in order toaccumulate all the respective plurality of requirements 792-D1-r 1,792-D1-r 2 into a single aggregated requirement 792-D1-12 to change thedata set 792-D1 of the associated block 792-B1. In step 1144, the system790 changes the data set 792-D1 of the respective block 792-B1 byperforming a flash block write to the respective block 792-B1 inconjunction with said aggregated requirement 792-D1-12. In someembodiments, steps 1141, 1142 and 1143 are executed by a first computeelement 700-c 1 within the system 790, and step 1144 is executed by asecond compute element 700-c 2 within the system 790. It is understood,however, that different compute elements may perform the various steps,or there may be more than two compute elements performing the steps, ora compute element may be combined with other hardware elements, such as,solely for example, the first compute element 700-c 1 with the randomaccess memory 791-RAM, or the second compute 700-c 2 with the randomaccess memory 791-RAM, or the second compute element 700-c 2 with theflash memory 792-flash.

FIG. 28A illustrates one embodiment of a system 800 configured togenerate automatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules. In oneparticular form of such embodiment, the system includes a first database700-DB configured to store a code sequence 8-code describing an actionto be performed by a target system 720 (FIG. 28A, FIG. 17A) on each of aplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6(FIG. 17A) stored in a shared memory pool 512 (FIG. 17A) in the targetsystem 720, where such shared memory pool 512 includes a plurality ofmemory modules 540-m 1, 540-m 2, 540-mk (FIG. 17A) associatedrespectively with a plurality of data interfaces 523-1, 523-2, 523-k(FIG. 17A) all belonging to the target system 720, in which the actionper each of the plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4,712-D5, 712-D6 comprises: (i) fetching the data set from the sharedmemory pool 512 in the target system 720, and (ii) processing the dataset fetched. The system 800 illustrated in FIG. 28 includes also a firstcompute element 700-com, having access to the first database 700-DB, andconfigured to convert the code sequence 8-code into a sequence ofexecutable instructions 8-exe, in which the sequence of executableinstructions 8-exe, when executed simultaneously by each of a pluralityof compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) of the targetsystem 720, results in a distributive fetching-and-processing procedure.By such procedure, each of the compute elements sends a plurality ofdata requests (for example, 7DR1, 7DR3, FIG. 17D) to at least some ofthe plurality of data interfaces (for example, 523-1, 523-2, FIG. 17D),in which each of the data requests is sent to one of the plurality ofdata interfaces. Also by such procedure, each of the compute elementsreceives, as a response to the specific data requests it has sent (forexample, to data request 7DR1 in FIG. 17D), from the data interfacereceiving the data request (for example, 523-1, FIG. 17D, FIG. 17E), areply (for example, 7SR1, FIG. 17E) including a specific one of the datasets (for example, 712-D1, FIG. 17E) stored in the memory module (forexample, 540-m 1, FIG. 17E) associated with the data interface (forexample, 523-1, FIG. 17D, FIG. 17E). Also by such procedure, each of thecompute elements processes the data sets it has received. The sending ofdata requests, receiving responses with data sets, and processing ofdata sets received, are continued by each of the plurality of computeelements 700-c 1, 700-c 2, 700-cn (FIG. 17A), until a first condition ismet.

In one embodiment, the conversion of the code sequence 8-code is acompilation process resulting in the sequence of executable instructions8-exe, following which the sequence of executable instructions isdistributed among the plurality of compute elements and data interfaces,thereby facilitating the distributive fetching-and-processing procedure.The first compute element 700-com, which may act as a complierperforming the conversion, needs to recognize certain aspects of thedata sets and certain aspects of how the data sets are to be processed,before such first compute element continues with the conversion of codesequence 8-code into the distributive fetching-and-processing procedure.As an example, the first compute element 700-com recognizes, byinspecting the code sequence 8-code, that (i) the plurality of data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A) are storedacross the plurality of memory modules 540-m 1, 540-m 2, 540-mk (FIG.17A) associated respectively with the plurality of data interfaces523-1, 523-2, 523-k (FIG. 17A), that (ii) any one of said plurality ofdata sets can be processed before or after any other of said pluralityof data sets, and therefore that (iii) each fetch for one of the datasets can be done by any one of the plurality of compute elements inconjunction with the data interface associated with the memory modulestoring that data set, asynchronously with any other of the fetches doneby any other of the plurality of compute elements in conjunction withany one of the data interfaces. The abovementioned recognition mayguarantee that the action described by code sequence 8-code may indeedbe successfully implemented by the distributive fetching-and-processingprocedure.

In the embodiment illustrated in FIG. 28A, the target system 720 and allof its components are not part of the base system 800, although the basesystem 800 and the target system 720 are in communicative contact. Inthe embodiment illustrated in FIG. 28A, after the code source 8-code hasbeen converted by the first compute element 700-com into the sequence ofexecutable instructions 8-exe, the sequence of executable instructions8-exe may be executed immediately by the target system 720, or,alternatively, may continue in an executable but not yet executed state,until some time, or condition, or event occurs to have the target system720 execute the sequence of executable instructions 8-exe.

FIG. 28B illustrates one embodiment of a system 800′ configured togenerate and execute a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules. System800′, unlike system 800 in FIG. 28A, includes a target system 720 (FIG.28B, FIG. 17A) as part of the base system 800′. Therefore, the system800′ includes the target system 720, which itself includes a sharedmemory pool 512 (FIG. 17A) with a plurality of memory modules 540-m 1,540-m 2, 540-mk (FIG. 17A) associated respectively with a plurality ofdata interfaces 523-1, 523-2, 523-k (FIG. 17A), and a plurality ofcompute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A). The system 800′includes also a first database 700-DB configured to store a codesequence 8-code describing an action to be performed by the targetsystem 720 on each of a plurality of data sets 712-D1, 712-D2, 712-D3,712-D4, 712-D5, 712-D6 (FIG. 17A) stored in the shared memory pool 512,in which the action per each of the plurality of data sets comprises:(i) fetching the data set from the shared memory pool 512 (FIG. 17A),and (ii) processing said data set fetched. The system 800′ includes alsoa first compute element 700-com, having access to the first database700-DB, and configured to convert the code sequence 8-code into asequence of executable instructions 8-exe.

In the system 800′ illustrated in FIG. 28B, the plurality of computeelements 700-c 1, 700-c 2, 700-cn is configured to executesimultaneously the sequence of executable instructions 8-exe, resultingin a distributive fetching-and-processing procedure. By this procedure,each of the plurality of compute elements (for example, 700-c 1, FIG.17D) sends a plurality of data requests (for example, 7DR1, 7DR3, FIG.17D) to at least some of the plurality of data interfaces (for example,523-1, 523-2, FIG. 17D), in which each of the data requests is sent toone of the plurality of data interfaces (for example, 7DR1 sent to523-1, and 7DR3 sent to 523-2). Also by this procedure, each of theplurality of compute elements (for example, 700-c 1, FIG. 17D) receives,as a response to each of the data requests (for example, to data request7DR1 in FIG. 17D), from the data interface receiving the data request(for example, 523-1, FIG. 17D, FIG. 17E), a reply (for example, 7SR1,FIG. 17E) including a specific one of the data sets (for example,712-D1, FIG. 17E) stored in the memory module (for example, 540-m 1,FIG. 17E) associated with the data interface (for example, 523-1, FIG.17D, FIG. 17E). Also by this procedure, each of the compute elementsprocesses the data sets it has received in response to the requests fordata it has sent to one or more data interfaces. The sending of datarequests, receiving responses with data sets, and processing of datasets received, are continued by each of the plurality of computeelements 700-c 1, 700-c 2, 700-cn, until a first condition is met.

It is noted that in stating that the sequence of executable instructions8-exe is executed simultaneously by each of the plurality of computeelements 700-c 1, 700-c 2, 700-cn (FIG. 17A) of the target system 720,it is understood that each of the compute elements 700-c 1, 700-c 2,700-cn (FIG. 17A) runs an instance of the sequence of executableinstructions 8-exe, in which each such instance runs asynchronously tothe other instances of the sequence of executable instructions 8-exe.One of the compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) can runany part of the sequence of executable instructions 8-exe, while anotherof the compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) can run anyother part of the sequence of executable instructions 8-exe at any giventime.

One embodiment is a system 800 configured to generate automatically aprocedure operative to distributively process a plurality of data setsstored on a plurality of memory modules. In one particular form of suchembodiment, the system 800 includes a first database 700-DB configuredto store a code sequence 8-code describing an action to be performed bya target system 720 (FIG. 28A, FIG. 17A) on each of a plurality of datasets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A) stored ina shared memory pool 512 (FIG. 17A), where the shared memory pool 512includes a plurality of memory modules 540-m 1, 540-m 2, 540-mk (FIG.17A) associated respectively with a plurality of data interfaces 523-1,523-2, 523-k (FIG. 17A) all belonging to the target system 720, in whichthe action per each of the plurality of data sets includes: (i) fetchingthe data set from the shared memory pool 512 in the target system 720,and (ii) processing said data set fetched. The system 800 also includesa first compute element 700-com, having access to the first database700-DB, and configured to convert the code sequence 8-code into asequence of executable instructions 8-exe, in which the sequence ofexecutable instructions 8-exe, when executed simultaneously by each of aplurality of compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) of thetarget system 720, results in a distributive fetching-and-processingprocedure. By this procedure, each compute element (for example, 700-c1) sends a plurality of data requests (for example, 7DR1, 7DR3, FIG.17D) to at least some of the plurality of data interfaces (for example,523-1, 523-2, FIG. 17D), in which each of the data requests is sent toone of the plurality of data interfaces. Also by this procedure, thecompute element (for example, 700-c 1) receives, as a response to eachof the data requests (for example, to data request 7DR1 in FIG. 17D),from the data interface receiving the data request (for example, 523-1,FIG. 17D, FIG. 17E), a reply (for example, 7SR1, FIG. 17E) including aspecific one of the data sets (for example, 712-D1, FIG. 17E) stored inthe memory module (for example, 540-m 1, FIG. 17E) associated with thedata interface (for example, 523-1, FIG. 17D, FIG. 17E). Also by thisprocedure, the compute element (for example, 700-c 1) processes the datasets it has received. The sending of data requests, receiving ofresponses, and processing of data sets received, by each of theplurality of compute elements 700-c 1, 700-c 2, 700-cn, continues untila first condition is met.

In a first possible alternative to the system just described, thespecific one of the data sets (for example, 712-D1, FIG. 17E) isselected by the data interface (for example, 523-1, FIG. 17E) from thememory module (for example, 540-m 1, FIG. 17E) such as to guarantee thatthe specific one of the data sets has not previously been sent inconjunction with previous replies made by the data interface 523-1 (FIG.17E).

In one possible configuration of the first possible alternative justdescribed, further the sequence of executable instructions 8-exe, whenexecuted simultaneously by each of the plurality of data interfaces523-1, 523-2, 523-k (FIG. 17A) of the target system 720 (FIG. 28A, FIG.17A), facilitates the selections, the replies, and therefore theguarantee.

It is noted that in stating that the sequence of executable instructions8-exe is executed simultaneously by each of the plurality of datainterfaces 523-1, 523-2, 523-k (FIG. 17A), it is understood that each ofthe data interfaces 523-1, 523-2, 523-k (FIG. 17A) runs an instance ofthe sequence of executable instructions 8-exe, in which each suchinstance runs asynchronously to the other instances of the sequence ofexecutable instructions 8-exe. One of the data interfaces 523-1, 523-2,523-k (FIG. 17A) can run any part of the sequence of executableinstructions 8-exe, while another of the data interfaces 523-1, 523-2,523-k (FIG. 17A) can run any other part of the sequence of executableinstructions 8-exe at any given time.

It is further noted that in stating that the sequence of executableinstructions 8-exe is executed simultaneously by each of the pluralityof compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) and that thesequence of executable instructions 8-exe is also executedsimultaneously by each of the plurality of data interfaces 523-1, 523-2,523-k (FIG. 17A), it is understood that:

(i) either the sequence of executable instructions 8-exe is run by boththe plurality of compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A)and the plurality of data interfaces 523-1, 523-2, 523-k (FIG. 17A),such that the plurality of compute elements 700-c 1, 700-c 2, 700-cn(FIG. 17A) run a first portion of the sequence of executableinstructions 8-exe that is dedicated for the compute elements, while theplurality of data interfaces 523-1, 523-2, 523-k (FIG. 17A) run a secondportion of the sequence of executable instructions 8-exe that isdedicated for the data interfaces,

(ii) or the sequence of executable instructions 8-exe actually comprisesa first set of executable instructions intended for the plurality ofcompute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A), and a second setof executable instructions intended for the plurality of data interfaces523-1, 523-2, 523-k (FIG. 17A).

In a second possible configuration of the first possible alternativedescribed above, further each of the data interfaces 523-1, 523-2, 523-k(FIG. 17A) is configured to receive some of the plurality of datarequests (for example, 7DR1, 7DR2, FIG. 17B) from any one of theplurality of compute elements (for example, from 700-c 1, 700-c 2, FIG.17B). Each of the data interfaces is configured also to identify fromthe data sets of the respective memory module (for example, 540-m 1,FIG. 17B) the ones of the data sets that were not yet served (forexample, 712-D1, 712-D2, FIG. 17B), thereby facilitating the guarantee.Each of the data interfaces is configured also to serve, as the reply(for example, 7SR1, 7SR2, FIG. 17C) to the data requests (for example,7DR1, 7DR2, FIG. 17B), the data sets identified (for example, 712-D1,712-D2, FIG. 17B, FIG. 17C). Each of the data interfaces is alsoconfigured to keep track of the ones of the data sets already served,thereby further facilitating the guarantee.

In a first possible variation of the second possible configuration justdescribed, further the data requests (for example, 7DR1, 7DR2, FIG.17B), according to the sequence of executable instructions 8-exe, do notspecify certain ones of the plurality of data sets to be served 712-D1,712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A), such that theidentification and keeping track is the only way by which said pluralityof data interfaces 523-1, 523-2, 523-k (FIG. 17A) know which one of theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6(FIG. 17A) is to be specifically served to the one of the plurality ofcompute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) making the datarequest, and such that the identification and keeping track is the onlyway of making sure, by the target system 720 (FIG. 28A, FIG. 17A), thatnone of the data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 isserved more than once, thereby facilitating the guarantee.

In a second possible variation of the second possible configurationdescribed above, further the sequence of executable instructions 8-exe,when executed simultaneously by each of the plurality of data interfaces523-1, 523-2, 523-k (FIG. 17A) of the target system 720 (FIG. 28A, FIG.17A), facilitates the identification, the serving, and the keepingtrack.

In a second possible alternative to the above described systemconfigured to generate automatically a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, further the first condition is a condition in which theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6(FIG. 17A) is served and processed in its entirety by the plurality ofcompute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A). Further, theplurality of compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) isconfigured to execute distributively a first task associated with theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6(FIG. 17A) by performing the processing of the data sets received, inwhich the execution of the first task can be done in any order of saidprocessing of said plurality of data sets. In sum, any one of saidplurality of data sets can be processed before or after any other ofsaid plurality of data sets.

In a third possible alternative to the above described system togenerate automatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules, furthereach of the compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) isconfigured, according to the sequence of executable instructions 8-exe,per each said sending of one of said data requests (for example, 7DR1,FIG. 17B) made by such compute element (for example, 700-c 1, FIG. 17B),to select one (for example, 523-1, FIG. 17B) of the plurality of datainterfaces 523-1, 523-2, 523-k (FIG. 17A) as a target of receiving suchdata request, in which the selection is a round robin selection or apseudo-random selection. Further, the selection of one of the pluralityof data interfaces as a target of receiving such data request may bedirected by load-balancing considerations, such that, as an example, adata interface that is relatively not loaded with data requests may beselected, or such that data interfaces associated with a relativelylarge number of data sets may be selected more frequently.

In a fourth possible alternative to the above described system togenerate automatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules, furtherthe code sequence 8-code is written in a high-level programminglanguage, and the conversion is a compilation process.

One embodiment is a system 800′ configured to generate and execute aprocedure operative to distributively process a plurality of data setsstored on a plurality of memory modules. In one particular form of suchembodiment, the system 800′ includes a target system 720 (FIG. 28B, FIG.17A), which itself includes a shared memory pool 512 (FIG. 17A), with aplurality of memory modules 540-m 1, 540-m 2, 540-mk (FIG. 17A)associated respectively with a plurality of data interfaces 523-1,523-2, 523-k (FIG. 17A), which also includes a plurality of computeelements 700-c 1, 700-c 2, 700-cn (FIG. 17A). The system 800′ alsoincludes a first database 700-DB configured to store a code sequence8-code describing an action to be performed by the target system 720 oneach of a plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5,712-D6 (FIG. 17A) stored in the shared memory pool 512, in which theaction per each of the plurality of data sets includes: (i) fetching thedata set from the shared memory pool 512, and (ii) processing the dataset fetched. The system also includes a first compute element 700-com,having access to the first database 700-DB, and configured to convertthe code sequence 8-code into a sequence of executable instructions8-exe. Further, the plurality of compute elements 700-c 1, 700-c 2,700-cn (FIG. 17A) is configured to execute simultaneously said sequenceof executable instructions 8-exe, resulting in a distributivefetching-and-processing procedure. By this procedure each of theplurality of compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) sendsa plurality of data requests (for example, 7DR1, 7DR3, FIG. 17D) to atleast some of the plurality of data interfaces (for example, 523-1,523-2, FIG. 17D), in which each of the data requests is sent to one ofthe plurality of data interfaces. Also by this procedure, each of thecompute elements receives, as a response to each of the data requests(for example, to data request 7DR1 in FIG. 17D), from the data interfacereceiving the data request (for example, 523-1, FIG. 17D, FIG. 17E), areply (for example, 7SR1, FIG. 17E) comprising a specific one of thedata sets (for example, 712-D1, FIG. 17E) stored in the memory module(for example, 540-m 1, FIG. 17E) associated with the data interface (forexample, 523-1, FIG. 17D, FIG. 17E). Also by this procedure, each of thecompute elements processes the data sets it has received. The sending ofdata requests, receiving of responses, and processing of data setsreceived, by each of the plurality of compute elements 700-c 1, 700-c 2,700-cn, continues until a first condition is met.

In a first possible alternative to the system 800′ just described,further the first condition is a condition in which the plurality ofdata 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A) is servedand processed in its entirety by the plurality of compute elements 700-c1, 700-c 2, 700-cn (FIG. 17A). Further, the plurality of computeelements 700-c 1, 700-c 2, 700-cn (FIG. 17A) is configured to executedistributively a first task associated with said plurality of data sets712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6 by performing theprocessing of the data sets received, in which the execution of saidfirst task can be done in any order of said processing of said pluralityof data sets. In sum, any one of said plurality of data sets can beprocessed before or after any other of said plurality of data sets.

In a second possible alternative to the above described system 800′configured to generate and execute a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, further the specific one of the data sets (for example,712-D1, FIG. 17E) is selected by the data interface (for example, 523-1,FIG. 17E) from the memory module (for example, 540-m 1, FIG. 17E), suchas to guarantee that said specific one of the data sets has notpreviously been sent in conjunction with previous replies made by thedata interface (for example, 523-1, FIG. 17E).

In one possible configuration of the second possible alternative justdescribed, further the sequence of executable instructions 8-exe, whenexecuted simultaneously by each of the plurality of data interfaces523-1, 523-2, 523-k (FIG. 17A), facilitates the selections, the replies,and therefore the guarantee.

In a third possible alternative to the above described system 800′configured to generate and execute a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, further the conversion is performed by the first computeelement 700-com just before the plurality of compute elements 700-c 1,700-c 2, 700-cn (FIG. 17A) starts executing simultaneously the sequenceof executable instructions 8-exe.

In one possible configuration of the third possible alternative justdescribed, further the first compute element 700-com communicates 80-comthe sequence of executable instructions 8-exe to the plurality ofcompute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A) just before theplurality of compute elements 700-c 1, 700-c 2, 700-cn starts executingsimultaneously the sequence of executable instructions 8-exe.

In a fourth possible alternative to the above described system 800′configured to generate and execute a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, further the first compute element 700-com is one of theplurality of compute elements 700-c 1, 700-c 2, 700-cn (FIG. 17A).

FIG. 29 illustrates one embodiment of a method for generatingautomatically a procedure operative to distributively process aplurality of data sets stored on a plurality of memory modules. In step1151, a first compute element 700-com receives a code sequence 8-codedescribing an action to be performed by a target system 720 (FIG. 28A,FIG. 17A) on each of a plurality of data sets 712-D1, 712-D2, 712-D3,712-D4, 712-D5, 712-D6 (FIG. 17A). Such data sets are stored in a sharedmemory pool 512 (FIG. 17A) which includes a plurality of memory modules540-m 1, 540-m 2, 540-mk (FIG. 17A) associated respectively with aplurality of data interfaces 523-1, 523-2, 523-k (FIG. 17A) allbelonging to the target system 720 (FIG. 28A, FIG. 17A). The action tobe performed includes: (i) fetching the data set from the shared memorypool 512 (FIG. 17A) in the target system 720 (FIG. 28A, FIG. 17A), and(ii) processing the data set fetched. In step 1152, the first computeelement 700-com recognizes, by inspecting the code sequence 8-code, that(i) the plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5,712-D6 (FIG. 17A) are stored across the plurality of memory modules540-m 1, 540-m 2, 540-mk (FIG. 17A) associated respectively with theplurality of data interfaces 523-1, 523-2, 523-k (FIG. 17A), that (ii)any one of said plurality of data sets can be processed before or afterany other of said plurality of data sets, and therefore that (iii) eachfetch for one of the data sets can be done by any one of the pluralityof compute elements in conjunction with the data interface associatedwith the memory module storing that data set, asynchronously with anyother of the fetches done by any other of the plurality of computeelements in conjunction with any one of the data interfaces. In step1153, the first compute element 700-com converts, according to therecognition, the code sequence 8-code into a sequence of executableinstructions 8-exe, in which the sequence of executable instructions8-exe, when executed simultaneously by each of the plurality of computeelements 700-c 1, 700-c 2, 700-cn of the target system 720, results in adistributive fetching-and-processing procedure operative, per each ofthe plurality of compute elements 700-c 1, 700-c 2, 700-cn, to executethree actions: According to the procedure, each one of the computeelements 700-c 1, 700-c 2, 700-cn sends a plurality of data requests(for example, compute element 700-c 1 sends 7DR1, 7DR3, FIG. 17D) to atleast some of the plurality of data interfaces (for example, 7DR1 to523-1 and 7DR3 to 523-2, FIG. 17D), in which each of the data requestsis sent to one of the plurality of data interfaces. Also according tothe procedure, the same compute element (in this example, 700-c 1)receives, as a response to each of the data requests sent (for example,in response to data request 7DR1 in FIG. 17D), from the data interfacereceiving the data request (for example, 523-1, FIG. 17D, FIG. 17E), areply (for example, 7SR1, FIG. 17E) including a specific one of the datasets (for example, 712-D1, FIG. 17E) stored in the memory module (forexample, 540-m 1, FIG. 17E) associated with the data interface fetchingthat data set (for example 523-1, FIG. 17D, FIG. 17E). Also according tothe procedure, the same compute element (for example, 700-c 1) processesall of the data sets (for example, 712-D1, 712-D3, FIG. 17C, FIG. 17E)it has received from whatever data interface (for example, from only523-1 as shown in FIG. 17C, or from both 523-1 and 523-2 as shown inFIG. 17E). The sending of data requests, receiving responses, andprocessing of data sets received, is done by each of the plurality ofcompute elements 700-c 1, 700-c 2, 700-cn in the target system 720,until a first condition is met.

In a first possible alternative to the method described above in FIG.29, further the recognition is achieved by the first compute element700-com identifying, in the code sequence 8-code, a loop, in which eachiteration of the loop describes the action to be performed on one of theplurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6(FIG. 17A), and further identifying, in the code sequence 8-code, thatthe plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5,712-D6 are of a data type intended for storage across the plurality ofmemory modules 540-m 1, 540-m 2, 540-mk (FIG. 17A).

In one possible configuration of the first possible alternative justdescribed, the recognition is further achieved by the first computeelement 700-com identifying, in the loop, that the processing of each ofthe plurality of data sets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5,712-D6 (FIG. 17A) is unrelated to any other of the plurality of datasets 712-D1, 712-D2, 712-D3, 712-D4, 712-D5, 712-D6.

In a second possible alternative to the method described above in thedescription of FIG. 29, further the recognition is achieved by the firstcompute element 700-com identifying, in the code sequence 8-code, asingle instruction to be performed on multiple data (SIMD), in whichsaid single instruction is associated with the processing and themultiple data are associated with said plurality of data sets 712-D1,712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A). Recognition isfurther achieved by the first compute element 700-com identifying, inthe code sequence 8-code, that the plurality of data sets 712-D1,712-D2, 712-D3, 712-D4, 712-D5, 712-D6 (FIG. 17A) are of a data typeintended for storage across said plurality of memory modules 540-m 1,540-m 2, 540-mk (FIG. 17A).

FIG. 30A illustrates one embodiment of a system 820 configured togenerate automatically a procedure operative to divide a processing taskbetween two or more compute elements. In one particular form of suchembodiment, the system includes a first database 800-DB configured tostore a code sequence 9-code describing an action to be performed on afirst data set 512-D1 stored in memory module 540-m 1, in which theaction includes (i) fetching the first data set 512-D1 from the memorymodule 540-m 1, and (ii) performing a first processing task on thefetched data set 512-D1. In this embodiment, the system 820 includes afirst compute element 800-c 1 configured to decide how to divide thefirst processing task into two separate sub-tasks, by recognizing thatthe first processing task can be performed distributively by a secondcompute element running a first sub-task, and then by a third computeelement running a second sub-task. The first compute element 800-c 1 isthen configured to convert the code sequence 9-code into a sequence ofexecutable instructions 9-exe operative to instruct such a secondcompute element regarding execution of the first sub-task, and operativeto instruct such a third compute element regarding execution of thesecond sub-task. Such instructions 9-exe may be sent and executed almostimmediately upon conversion, or may be stored initially in the system820 with the first compute element 800-c 1 for a specific period of timebefore execution or executed when some condition arises, or may be sentto either or both of a first server 821 and a second server 822 wherethey may be stored for a specific period of time before execution orexecuted when some condition arises.

After conversion, the instructions 9-exe are sent to a second computeelement 800-c 2 in the first server 821 and a third compute element800-c 3 in the second server 822. In the particular embodiment shown inFIG. 30A, both the first server 821 and the second server 822 arelocated outside the system 820, each of these two servers is separatefrom the other. Further, the first server includes the second computeelement 800-c 2, the memory module 540-m 1 storing the first data set512-D1 prior to any processing, and eventually a modified data set 5-D1′that has been derived by the second compute element 800-c 2 from thefirst data set 512-D1 using the first processing sub-task in theinstructions 9-exe. The modified data set 5-D1′ is received by thesecond server 822, where the third compute element 800-c 3 is configuredto execute on this modified data set 5-D1′ the second processingsub-task directed by the executable instructions 9-exe.

Various alternative embodiments not shown in FIG. 30A are also possible,including:

First server 821 and all of its included elements—the second computeelement 800-c 2, the memory module 540-m 1 with the first data set512-D1, and the modified data set 5-D1′—are part of the system 820rather than being external to that system 820; or

There is not a first server 821, but rather the elements of that server821—the second compute element 800-c 2, the memory module 540-m 1 withthe first data set 512-D1, and the modified data set 5-D1′—are part ofthe system 820, possibly co-located on a single server with firstcompute element 800-c 1; or

The second server 822 and all of its included elements—the third computeelement 800-c 3, and the modified data set 5-D1′—are part of the system820 rather being external to that system 820; or

There is not a second server 822, but rather the elements of that server822—the third compute element 800-c 3, and the modified data set5-D1′—are part of the system 820, possibly co-located on a single serverwith first compute element 800-c 1.

FIG. 30B illustrates one embodiment of a system 820′ configured togenerate and execute a procedure operative to divide a processing taskbetween two or more compute elements. The system 820′ portrayed in FIG.30B includes of the elements illustrated in FIG. 30A, but with twodifferences. First, as shown in FIG. 30B, all of the main elements,including the database 800-DB, the first compute element 800-c 1, thefirst server 821 with its elements, and the second server 822 with itselements, are all part of the same system 820′. None of these componentsare outside the system 820′. Second, the first compute element 800-c 1communicates 82-com the sequence of executable instructions 9-exe to thesecond compute element 800-c 2 and the third compute element 800-c 3just before the second compute element 800-c 2 starts executing thesequence of executable instructions 9-exe, meaning that suchcommunication 82-com may be the trigger for executing the sequence ofexecutable instructions 9-exe, or that such communication 82-com andexecuting the sequence of executable instructions 9-exe are togetherpart of an on-going sequence on inter-related events.

One embodiment is a system 820 configured to generate automatically aprocedure operative to divide a processing task between at least twocompute elements. In one particular form of such embodiment, the system820 includes a first database 800-DB configured to store a code sequence9-code describing an action to be performed on a first data set 512-D1stored in a memory module 540-m 1, in which the action comprises: (i)fetching the first data set 512-D1 from the memory module 540-m 1, and(ii) performing a first processing task on said first data set 512-D1fetched. The system 820 further includes a first compute element 800-c1, having access to the first database 800-DB, and configured to convertthe code sequence 9-code into a sequence of executable instructions9-exe, in which the sequence of executable instructions 9-exe isoperative to instruct a second compute element 800-c 2 associated withthe memory module 540-m 1 to: (i) access the first data set 512-D1 inthe memory module 540-m 1; and (ii) perform a first processing sub-taskon said first data set accessed, thereby resulting in a modified dataset 5-D1′. The sequence of executable instructions 9-exe is furtheroperative to instruct a third compute element 800-c 3 to: (i) obtain themodified data set 5-D1′; and (ii) perform a second processing sub-taskon said modified data set obtained. The first processing sub-task,together with the second processing sub-task, constitute the firstprocessing task, thereby achieving the action distributively by thesecond compute element 800-c 2 and the third compute element 800-c 3.

In a first possible alternative to the just described system 820configured to generate automatically a procedure operating to divide aprocessing task between at least two compute elements, further thesecond compute element 800-c 2 is a data interface 523-1 (FIG. 10B)associated with the memory module 540-m 1, and the accessing of thefirst data set is a random access read cycle performed on the memorymodule 540-m 1 by the data interface 523-1 (FIG. 10B). Such datainterface 523-1 (FIG. 10B) may be the controller of the memory module540-m 1.

In a second possible alternative to the system 820 configured togenerate automatically a procedure operating to divide a processing taskbetween at least two compute elements, further the third compute element800-c 3 is communicatively connected with the second compute element800-c 2 via a switching network 550 (FIG. 10B) through which theobtaining of the modified data set 5-D1′ is done.

In a possible configuration of the second possible alternative justdescribed, further the memory module 540-m 1 is a part of a sharedmemory pool 512 (FIG. 10B) accessible to the third compute element 800-c3 via the switching network 550 (FIG. 10B).

In a possible variation of the possible configuration just described,further the first processing sub-task is a stored procedure.

In a second possible configuration of the second possible alternativedescribed above, further the second compute element 800-c 2 and thememory module 540-m 1 both reside in one server 821.

In a possible variation of the second possible configuration justdescribed, further third compute element 800-c 3 resides outside the oneserver 821, and in a second server 822.

One embodiment is a system 820′ configured to generate and execute aprocedure operative to divide a processing task between at least twocompute elements. In one particular form of such embodiment, the system820′ includes a first database 800-DB configured to store a codesequence 9-code describing an action to be performed on a first data set512-D1, in which the action comprises: (i) accessing the first data set512-D1, and (ii) performing a first processing task on the data set512-D1 accessed. The system 820′ further includes a first computeelement 800-c 1, having access to the first database 800-DB, andconfigured to convert said the sequence 9-code into a sequence ofexecutable instructions 9-exe. The system 820′ further includes a memorymodule 540-m 1 storing the first data set 512-D1. The system 820′further includes a second compute element 800-c 2 associated with thememory module 540-m 1 and configured to execute the sequence ofexecutable instructions 9-exe, resulting in a procedure operative to:(i) access the first data set 512-D1 in the memory module 540-m 1; and(ii) generate a modified data set 5-D1′ by performing a first processingsub-task on the first data set 512-D1 accessed. The system 820′ furtherincludes a third compute element 800-c 3 configured to execute thesequence of executable instructions 9-exe, resulting in continuation ofthe procedure, in which such continuation is operative to: (i) obtainthe modified data set 5-D1′; and (ii) perform a second processingsub-task on said modified data set 5-D1′ obtained. The first processingsub-task, together with said second processing sub-task, constitute thefirst processing task, thereby achieving the action distributively bythe second compute element 800-c 2 and the third compute element 800-c3.

In a first possible alternative to the just described system 820′configured to generate and execute a procedure operating to divide aprocessing task between at least two compute elements, further theconversion is performed by the first compute element 800-c 1 just beforethe second compute element 800-c 2 starts executing the sequence ofexecutable instructions 9-exe.

In a possible configuration of the first possible alternative justdescribed, further the first compute element 800-c 1 communicates 82-comthe sequence of executable instructions 9-exe to the second computeelement 800-c 1 and to the third compute element 800-c 3 just before thesecond compute element 800-c 2 starts executing the sequence ofexecutable instructions 9-exe.

In a second possible alternative to the system 820′ configured togenerate and execute a procedure operating to divide a processing taskbetween at least two compute elements, further the code sequence 9-codeis written in a high-level programming language, and further theconversion is a compilation process.

In a third possible alternative to the system 820′ configured togenerate and execute a procedure operating to divide a processing taskbetween at least two compute elements, further the first compute element800-c 1 and the second compute element 800-c 2 are a same computeelement.

In a fourth possible alternative to the system 820′ configured togenerate and execute a procedure operating to divide a processing taskbetween at least two compute elements, further the first compute element800-c 1 and the third compute element 800-c 3 are a same computeelement.

FIG. 31 illustrates one embodiment of a method for generatingautomatically a procedure operative to divide a processing task betweenat least two compute elements. In step 1161, a first compute elementreceives a code sequence 9-code describing an action to be performed ona first data set 512-D1, in which the action comprises: (i) accessingthe first data set, and (ii) performing a first processing task on saidfirst data set accessed. In step 1162, the first compute elementrecognizes, by inspecting the code sequence 9-code, that the firstprocessing task is equivalent to performing a first processing sub-taskfollowed by performing a second processing sub-task. In step 1163,according to the recognition, the first compute element converts thecode sequence 9-code into a sequence of executable instructions 9-exe,wherein the sequence of executable instructions 9-exe is operative toinstruct a third compute element 800-c 3 to: (i) send a request to asecond compute element 800-c 2, associated with a memory module 540-m 1storing the first data set 512-D1, to perform the first processingsub-task on the first data set 512-D1, (ii) obtain from the secondcompute element 800-c 2 a modified data set 5-D1′ as a response to therequest; and (iii) perform the second processing sub-task on themodified data set 5-D1′ obtained. As a result of the steps describedherein, the action is achieved distributively by the second computeelement 800-c 2 and the third compute element 800-c 3.

In a first possible alternative to the method described above in FIG.31, further the sequence of executable instructions 9-exe is furtheroperative to instruct the second compute element 800-c 2 associated withthe memory module 540-m 1 to: (i) receive the request; (ii) access thefirst data set 512-D1 in the memory module 540-m 1 as a response to therequest; (iii) perform the first processing sub-task on the first dataset accessed, thereby resulting in the modified data set 5-D1′; and (iv)send the modified data set 5-D1′ to the third compute element 800-c 3.

In a first possible configuration of the first possible alternativeembodiment described above, further the accessing is a random accessread cycle performed by the second compute element 800-c 2 on the memorymodule 540-m 1.

In a second possible configuration of the first possible alternativeembodiment described above, further the sequence of executableinstructions 9-exe, or at least a portion thereof that is relevant forthe second compute element 800-c 2, is delivered to the second computeelement 800-c 2 by the third compute element 800-c 3 during run-time ofthe third compute element 800-c 3.

In a possible variation of the second possible configuration justdescribed, further the sequence of executable instructions 9-exe isdelivered to the third compute element 800-c 3 by the first computeelement 800-c 1 just before run-time of the third compute element 800-c3.

In a third possible configuration of the first possible alternativeembodiment described above, further the sequence of executableinstructions 9-exe is delivered to the second compute element 800-c 2 bythe first compute element 800-c 1 just before run-time of the thirdcompute element 800-c 3.

In a second possible alternative to the method described above in FIG.31, further the second compute element 800-c 2 and the memory module540-m 1 are associated a-priori with a stored procedure, in which thestored procedure is the first processing sub-task.

In a third possible alternative to the method described above in FIG.31, further the recognition that the first processing task is equivalentto performing the first processing sub-task followed by performing thesecond processing sub-task, is achieved by matching the first processingtask to a database comprising different combinations of sub-tasks andresulting tasks.

In a fourth possible alternative to the method described above in FIG.31, further the recognition that the first processing task is equivalentto performing the first processing sub-task followed by performing thesecond processing sub-task is achieved by concluding, from inspectingthe code sequence 9-code, that the first processing task is explicitlydescribed as the first processing sub-task followed by the secondprocessing sub-task.

In a fifth possible alternative to the method described above in FIG.31, further the association of the second compute element 800-c 2 withthe memory module 540-m 1 is identified by the first compute element800-c 1 during the recognition, by the first compute element's 800-c 1concluding, from inspecting the code sequence 9-code, that the firstdata set 512-D1 is of a data type that is associated with the secondcompute element 800-c 2 and the memory module 540-m 1.

In a sixth possible alternative to the method described above in FIG.31, further the association of the second compute element 800-c 2 withthe memory module 540-m 1 is identified by the third compute element800-c 3 during execution of the sequence of executable instructions9-exe by the third compute element 800-c 3, using information oroperations available to the third compute element 800-c 3 duringrun-time.

FIG. 32 illustrates one embodiment of a system 840 configured to performefficiently a first processing task in conjunction with each of aplurality of data sets 512-D1, 512-D2. In one particular form of suchembodiment, the system 840 includes a first code sequence 6-code, whichitself includes a plurality of general commands 6-coms and a specificcommand 6-s-com. The specific command 6-s-com includes a description6-des of a first processing task to be performed multiple times, eachtime in conjunction with one of the data sets 512-D1, 512-D2. The system840 includes also a first compute element 840-c 1, that has access tothe commands in the code sequence 6-code. The first compute element840-c 1 is configured to automatically (without any review by a person,in accordance with pre-defined instructions) review the commands,identify the specific command 6-s-com, by identifying, within thespecific command, that the first processing task, described by 6-des, isto be performed in conjunction with the data sets 512-D1, 512-D2, and,according to the prior identifications, convert the description 6-desinto a first sequence of executable instructions 6-exe constituting anefficient implementation of the first processing task. The system 840includes also a second compute element 840-c 2 that has access to thegeneral commands 6-coms and the specific command 6-s-com, and thatfollows the commands until the specific command 6-s-com is reached,after which the second compute element 840-c 2 initiates a plurality ofprocessing events. Each processing event includes executing one of aplurality of instances 6-exe 3, 6-exe 4 of the first sequence ofexecutable instructions 6-exe in conjunction with the data sets. Forexample, a first processing event may be execution by a third computeelement 840-c 3 of the first instance 6-exe 3 in conjunction with thefirst data set 512-D1. As another example, a second processing event maybe execution by a fourth compute element 840-c 4 of a second instance6-exe 4 in conjunction with the second data set 512-D2. The execution ofthe processing events results in the system 840 performing efficientlythe first processing task in conjunction with the plurality of data sets512-D1, 512-D2.

In some embodiments, the second compute element 840-c 2 initiates theprocessing events by sending initiation requests to the compute elements840-c 3, 840-c 4. The sending of the initiation requests may be directedby a procedure 5-pro of the system 840, in which the procedure 5-pro isassociated with efficiently managing and communicating data across thesystem 840. Procedure 5-pro may be used by the system to allocate aspecific data set for processing in a specific compute elements, suchthat, as an example, once compute element 840-c 2 initiates one of theprocessing events in conjunction with compute element 840-c 3, it isprocedure 5-pro that takes care of distributing the instance 6-exe 3 tocompute element 840-c 3, and it is procedure 5-pro that takes care ofallocating the data set 512-D1 to compute element 840-c 3, perhapsbecause the procedure 5-pro is aware of a fact that data set 512-D1 isstored in a memory module that is closer to compute element 840-c 3 thanit is to compute element 840-c 4. Each of the plurality of computeelements 840-c 3, 840-c 4 and the second compute element 840-c 2 areoperative to execute at least a portion of the procedure 5-pro relevantto that compute element. Procedure 5-pro is aware of the underlyingarchitecture of system 840, such as communication network topology anddata proximity to compute elements, and is therefore best suited formaking data allocation decisions as explained above. It is noted thatthe underlying architecture of system 840 is not necessarily expressedin the code sequence 6-code, but it is known at the time of generatingProcedure 5-pro, possibly to the designer of system 840, and istherefore a “property” of system 840 which is not derived from codesequence 6-code. In addition, it is noted that the description 6-des ofthe first processing task to be performed in conjunction with the datasets 512-D1, 512-D2 is not known to the designer of system 840, andtherefore the system itself needs to convert description 6-des intoefficient executable instructions such as 6-exe.

In various embodiments, the system 840 includes a sub-system which isitself a distributed processing system 840-d. This distributedprocessing system 840-d includes, in some embodiments, the secondcompute element 840-c 2 with the plurality of general commands 6-coms,the first sequence of executable instructions 6-exe, the second 840-c 3and third 840-c 4 compute elements, and the procedure 5-pro. In someembodiments, the third compute element 840-c 3 includes data from thefirst data set 512-D1 and the instance 6-exe 3 associated with the thirdcompute element 840-c 3, plus the fourth compute element 840-c 4includes data from the second data set 512-D2 and the instance 6-exe 4associated with the fourth compute element 840-c 4.

The various embodiments as described herein provide a superior solutionto the difficulty of effectively converting commands into instructionsexecutable by compute elements within a system. On one hand, it would behighly complex, and possibly even unachievable, to convert all of thehigh-level commands in a code sequence 6-code to efficientsystem-tailored machine executable code. There are three reasons forthis difficulty, any one of which, or all of which, may be present in adata processing system. The first reason for the difficulty is that theinstruction set is diverse. The second reason for the difficulty is thatnot all types of commands lend themselves to efficient conversion. Thethird reason for the difficulty is that not all types of commands canexploit, or be tailored-to, a specific system architecture. On the otherhand, many high-level commands do not need to be efficiently convertedto executable instructions, since the interpretation of such commandsand/or the conversion of such commands to even inefficient executableinstructions presents a “good enough” way of following such commands.The way is “good enough” because execution of such commands does notpresent a real bottleneck when it comes to overall system performance,and hence does not negatively impact system performance.

In short, some commands, and in particular specific task-defining codewithin specific commands, present problems of execution, and must behandled specially, whereas other commands, in particular generalcommands, do not need to be efficiently converted to executableinstruction since the commands do not create a bottleneck and efficientconversion would not significantly improve system performance.

To solve these problems, that is, to improve system performance bygiving special handling to specific task-defining code within specificcommands, the embodiments proposed herein distinguish between multiplegeneral commands 6-coms on the one hand, and on the other hand aspecific command 6-s-com describing 6-des a processing task to beperformed in conjunction with multiple data sets. The specific command6-s-com is recognized as special by the system 840, which then convertsat least the description 6-des within the specific command into machineexecutable code that is optimally configured to be processed by thesystem 840. In this way, the speed and efficiency of the system 840 areenhanced. It is noted that the description 6-des within the specificcommand 6-s-com, which may be a mathematical expression or an algorithmwritten using the high level language, may be relatively easilyconverted, efficiently, into executable instructions, either directly,or via an intermediary high-level language, such as the C language.

Various embodiments use a procedure 5-pro in the system 840 tocommunicate data across the system 840, in which such procedure 5-prohas various parts that may be executed by second compute element 840-c 2and the multiple compute elements 840-c 3, 840-c 4. In variousembodiments, the procedure 5-pro may direct instances of the executablecode 6-exe to be executed by different compute elements, for example840-c 3 to execute 6-exe 3 and 840-c 4 to execute 6-exe 4. In variousembodiments, the procedure 5-pro may direct various of the data sets todifferent compute elements, for example 512-D1 to 840-c 3 and 512-D2 to840-c 4. The procedure 5-pro may be stored in any of the computeelements, 840-c 1, 840-c 2, 840-c 3, 840-c 4 or memories thereof, or maybe stored in an entirely separate compute element. The procedure 5-prois optimized to take advantage of the requirements and capabilities ofthe specific elements in the distributed processing system 840-d, and insome embodiments of the requirements and capabilities of elements in thesystem 840 other than those in the distributed processing system 840-d.In some embodiments, 5-pro understands which data set, such as 512-D1 or512-D2, resides in a memory module associated with a specific computeelement, such as 840-c 3 or 840-c 4, and then directs the specificcompute element to execute the task on the data set residing in thatcompute element (for example, compute element 840-c 3 executes a task ondata set 512-D1, and compute element 840-c 4 executes a task on data set512-D2). In all of the embodiments in which the procedure 5-pro isoperable, the procedure 5-pro in some way or ways improves the speed andefficiency of the system 840. The procedure 5-pro takes care of the“management aspects” of carrying our specific command 6-s-com in view ofsystem 840 architecture, and may be independent of the description 6-desappearing in 6-s-com, while the first sequence of executableinstructions 6-exe, which is totally dependent on the description 6-desand directly derived from it, takes care of efficiently executing thefirst processing task on compute elements 840-c 3, 840-c 4.

In various embodiments, the first compute elements 840-c 1 is aware ofthe requirements and capabilities of the specific compute elements 840-c2, 840-c 3, 840-c 4 in the distributed processing system 840-d. In theseembodiments, the first compute element 840-c 1 converts the description6-des in specific command 6-s-com in a manner to optimize the machineexecutable code 6-exe for use and processing by these compute elements840-c 2, 840-c 3, 840-c 4. In these embodiments, the efficiency of theconversion process is enhanced in order to improve the speed andefficiency of the system 840.

One embodiment is a system 840 configured to perform efficiently a firstprocessing task in conjunction with each of a plurality of data sets512-D1, 512-D2. In one particular form of such embodiment, the system840 includes a first code sequence 6-code comprising (i) a plurality ofcommands 6-coms, and (ii) a specific command 6-s-com comprising adescription 6-des of a first processing task to be performed inconjunction with each of a plurality of data sets 512-D1, 512-D2. Thesystem 840 includes also a first compute element 840-c 1 having accessto the code sequence 6-code and configured to: (i) identifyautomatically, by inspecting the specific command 6-s-com within thefirst code sequence 6-code, that the first processing task is to beperformed in conjunction with each of said plurality of data sets512-D1, 512-D2, and (ii) according to said identification, convert,specifically, said description 6-des, into a first sequence ofexecutable instructions 6-exe constituting an efficient implementationof said first processing task. The system 840 includes also a secondcompute element 840-c 2, having access to at least the plurality ofcommands 6-coms, and configured to first follow the plurality ofcommands 6-coms until the specific command 6-s-com is reached, and theninitiate a plurality of processing events, in which each of theprocessing events comprises executing an instance (6-exe 3 is one suchinstance, 6-exe 4 is another) of the first sequence of executableinstructions 6-exe in conjunction with one of the data sets 512-D1,512-D2 (e.g., a first processing event would be an execution of instance6-exe 3, which may be identical to 6-exe, in conjunction with data set512-D1), thereby resulting in performing efficiently the firstprocessing task in conjunction with each of the plurality of data sets512-D1, 512-D2.

In a first possible alternative to the system 840 just described toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, the system 840 furthercomprises a plurality of compute elements 840-c 3, 840-c 4, wherein theplurality of processing events occur respectively in the plurality ofcompute elements.

In a first possible configuration of the first possible alternativesystem described above, further the instances 6-exe 3, 6-exe 4 of thefirst sequence of executable instructions 6-exe are available to theplurality of compute elements 840-c 3, 840-c 4 through the system 840sending such instances 6-exe 3, 6-exe 4 to the plurality of computeelements 840-c 3, 840-c 4, or through the plurality of compute elements840-c 3, 840-c 4 obtaining the instances 6-exe 3, 6-exe 4 from thesystem 840.

In a second possible configuration of the first possible alternativesystem described above, further the plurality of data sets 512-D1,512-D2 is available respectively to the plurality of compute elements840-c 3, 840-c 4 through the plurality of compute elements, 840-c 3,840-c 4, respectively, being pointed to the plurality of data sets512-D1, 512-D32 by the system 840.

In a third possible configuration of the first possible alternativesystem described above, further the initiation is done by the secondcompute element 840-c 2 sending a plurality of initiation requestsrespectively to the plurality of compute elements 840-c 3, 840-c 4.

In a first possible variation the third possible configuration describedabove, further the plurality of initiation requests also convey to theplurality of compute elements 840-c 3, 840-c 4, respectively, theplurality of data sets 512-D1, 512-D2 (that is, data set 512-D1 isconveyed to compute element 840-c 3, and data set 512-D2 is conveyed tocompute element 840-c 4).

In a second possible variation of the third possible configurationdescribed above, further the plurality of initiation requests alsoconvey to the plurality of compute elements 840-c 3, 840-c 4respectively a plurality of instances 6-exe 3, 6-exe 4 of the firstsequence of executable instructions 6-exe (that is, instance 6-exe 3 isconveyed to compute element 840-c 3, and instance 6-exe 4 is conveyed tocompute element 840-c 4).

In a third possible variation of the third possible configurationdescribed above, further the sending of the plurality of initiationrequests is directed by a procedure 5-pro of the system 840, in whichthe procedure 5-pro is associated with managing and communicating dataacross the system 840, such that each of the plurality of computeelements 840-c 3, 840-c 4 and the second compute element 840-c 2 isoperative to execute at least a portion of the procedure 5-pro relevantto that compute element.

In one possible option of the third possible variation described above,further execution of the procedure 5-pro together with execution of theinstances 6-exe 3, 6-exe 4 of the first sequence of executableinstructions 6-exe implement the specific command 6-s-com.

In a fourth possible configuration of the first possible alternativesystem described above, further the plurality of compute elements 840-c3, 840-c 4 together with the second compute element 840-c 2 constituteat least a part of a distributed processing system 840-d.

In a second possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the plurality ofprocessing events occur in the second compute element 840-c 2.

In a third possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the first computeelement 840-c 1 and the second compute element 840-c 2 are a samecompute element.

In a fourth possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the following of theplurality of commands 6-coms is started after the conversion of thedescription 6-des.

In a fifth possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the conversion of thedescription 6-des is done after the following of at least some of theplurality of commands 6-coms, but before the initiation of the pluralityof processing events.

In a possible configuration of the fifth possible alternative to thesystem 840 described above, further the conversion of the description6-des is performed just-in-time for the initiation of the plurality ofprocessing events. That is to say, the initiation of the plurality ofprocessing events begins right after the conversion of the description6-des.

In a sixth possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the following of theplurality of commands 6-coms is an interpretation process associatedwith the plurality of commands.

In a possible configuration of the sixth possible alternative to thesystem 840 described above, further the initiation of the plurality ofprocessing events is performed instead of the second compute element840-c 2 interpreting the specific command 6-s-com, thereby furtherfacilitating the performing efficiently of the first processing task inconjunction with each of the plurality of data sets 512-D1, 512-D2.

In a seventh possible alternative to the system 840 described above toperform efficiently a first processing task in conjunction with each ofa plurality of data sets 512-D1, 512-D2, further the code sequence6-code is a source code written in a high level language, thedescription of the first processing task is written using the same highlevel language, and the conversion of the description 6-des is acompilation process.

FIG. 33 illustrates one embodiment of a method for performingefficiently and distributively a first processing task in conjunctionwith each of a plurality of data sets 512-D1, 512-D2. In step 1171, adistributed processing system 840, including a plurality of computeelements 840-c 3, 840-c 4 and an additional compute element 840-c 2,receives a first code sequence 6-code comprising (i) a plurality ofgeneral commands 6-coms and (ii) a specific command 6-s-com comprising adescription 6-des of a first processing task to be performed inconjunction with each of the plurality of data sets 512-D1, 512-D2stored in the distributed processing system 840. In step 1172, thedistributed processing system 840 obtains a first sequence of executableinstructions 6-exe converted from the description 6-des of the firstprocessing task, in which the first sequence of executable instructions6-exe is operative to be effectively executed by each of the pluralityof compute elements 840-c 3, 840-c 4, thereby implementing effectivelythe first processing task. In step 1173, the additional compute element840-c 2 follows the plurality of commands 6-coms, until the specificcommand 6-s-com is reached. In step 1174, the additional compute element840-c 2 initiates a procedure 5-pro associated with the distributedprocessing system 840, in which the procedure 5-pro is operative to (i)allocate the plurality of data sets 512-D1, 512-D2 to the plurality ofcompute elements 840-c 3, 840-c 4, and (ii) share instances 6-exe 3,6-exe 4 of the first sequence of executable instructions 6-exe with theplurality of compute elements 840-c 3, 840-c 4. In step 1175, each ofthe plurality of compute elements 840-c 3, 840-c 4 activates therespective instance (e.g., 840-c 3 activates 6-exe 3, 840-c 4 activates6-exe 4) of the first sequence of executable instructions 6-exe inconjunction with the data set allocated to the compute element (e.g.,512-D1 allocated to 840-c 3, 512-D2 allocated to 840-c 4), therebyperforming efficiently and distributively the first processing task inconjunction with each of the plurality of data sets 512-D1, 512-D2.

In a first possible alternative to the method described above in FIG.33, further the distributed system 840 identifies, by inspecting thespecific command 6-s-com within the first code sequence 6-code, that thefirst processing task, as described in the specific command 6-s-com, isto be performed in conjunction with each of the plurality of data sets512-D1, 512-D2. Further, the obtaining of the first sequence ofexecutable instructions by the distributed processing system 840 is doneas a result of such identification.

In a possible configuration of the first possible alternative to themethod described in FIG. 33, further the obtaining of the first sequenceof executable instructions 6-exe by the distributed processing system840 comprises performing the conversion of the description 6-des, inwhich the conversion is done by the distributed processing system 840.

In a possible variation of the possible configuration just described,further the code sequence 6-code is a source code written in a highlevel language, the description 6-des of the first processing task iswritten using the high level language as part of the source code, andthe conversion of the description 6-des is a compilation process.

In one option of the possible variation just described, further thefollowing the plurality of commands 6-coms by the additional computeelement 840-c 2 is an interpretation process associated with theplurality of commands 6-coms.

In a second possible alternative to the method described above in FIG.33, further the specific command 6-s-com is a single instruction to beperformed on multiple data (SIMD), in which the single instruction isassociated with the first processing task and the multiple data isassociated with the plurality of data sets 512-D1, 512-D2. Further, saididentifying automatically, that the first processing task is to beperformed in conjunction with each of said plurality of data sets, isdone by identifying that the specific command is the single instructionto be performed on multiple data (SIMD), in which such identificationmay be directed by recognizing a certain format associated with thespecific command.

In a third possible alternative to the method described above in FIG.33, further the specific command 6-s-com is a map function associatedwith a lambda operator and an array of data, in which the lambdaoperator is the description 6-des of the first processing task, and thearray of data is the plurality of data sets 512-D1, 512-D2. Further,said identifying automatically, that the first processing task is to beperformed in conjunction with each of said plurality of data sets, isdone by identifying that the specific command is the map functionassociated with the lambda operator and an array of data, in which suchidentification may be directed by recognizing a certain formatassociated with the map function.

In this description, numerous specific details are set forth. However,the embodiments/cases of the invention may be practiced without some ofthese specific details. In other instances, well-known hardware,materials, structures and techniques have not been shown in detail inorder not to obscure the understanding of this description. In thisdescription, references to “one embodiment” and “one case” mean that thefeature being referred to may be included in at least oneembodiment/case of the invention. Moreover, separate references to “oneembodiment”, “some embodiments”, “one case”, or “some cases” in thisdescription do not necessarily refer to the same embodiment/case.Illustrated embodiments/cases are not mutually exclusive, unless sostated and except as will be readily apparent to those of ordinary skillin the art. Thus, the invention may include any variety of combinationsand/or integrations of the features of the embodiments/cases describedherein. Also herein, flow diagram illustrates non-limitingembodiment/case example of the methods, and block diagrams illustratenon-limiting embodiment/case examples of the devices. Some operations inthe flow diagram may be described with reference to theembodiments/cases illustrated by the block diagrams. However, the methodof the flow diagram could be performed by embodiments/cases of theinvention other than those discussed with reference to the blockdiagrams, and embodiments/cases discussed with reference to the blockdiagrams could perform operations different from those discussed withreference to the flow diagram. Moreover, although the flow diagram maydepict serial operations, certain embodiments/cases could performcertain operations in parallel and/or in different orders from thosedepicted. Moreover, the use of repeated reference numerals and/orletters in the text and/or drawings is for the purpose of simplicity andclarity and does not in itself dictate a relationship between thevarious embodiments/cases and/or configurations discussed. Furthermore,methods and mechanisms of the embodiments/cases will sometimes bedescribed in singular form for clarity. However, some embodiments/casesmay include multiple iterations of a method or multiple instantiationsof a mechanism unless noted otherwise. For example, a system may includemultiple compute elements, each of which is communicatively connected tomultiple servers, even though specific illustrations presented hereininclude only one compute element or a maximum of two compute elements.

Certain features of the embodiments/cases, which may have been, forclarity, described in the context of separate embodiments/cases, mayalso be provided in various combinations in a single embodiment/case.Conversely, various features of the embodiments/cases, which may havebeen, for brevity, described in the context of a single embodiment/case,may also be provided separately or in any suitable sub-combination. Theembodiments/cases are not limited in their applications to the detailsof the order or sequence of steps of operation of methods, or to detailsof implementation of devices, set in the description, drawings, orexamples. In addition, individual blocks illustrated in the figures maybe functional in nature and do not necessarily correspond to discretehardware elements. While the methods disclosed herein have beendescribed and shown with reference to particular steps performed in aparticular order, it is understood that these steps may be combined,sub-divided, or reordered to form an equivalent method without departingfrom the teachings of the embodiments/cases. Accordingly, unlessspecifically indicated herein, the order and grouping of the steps isnot a limitation of the embodiments/cases. Embodiments/cases describedin conjunction with specific examples are presented by way of example,and not limitation. Moreover, it is evident that many alternatives,modifications and variations will be apparent to those skilled in theart. Accordingly, it is intended to embrace all such alternatives,modifications and variations that fall within the spirit and scope ofthe appended claims and their equivalents.

What is claimed is:
 1. A system configured to generate automatically aprocedure operative to distributively process a plurality of data setsstored on a plurality of memory modules, comprising: a first databaseconfigured to store a code sequence describing an action to be performedby a target system on each of a plurality of data sets stored in ashared memory pool comprising a plurality of memory modules associatedrespectively with a plurality of data interfaces all belonging to thetarget system, in which the action per each of the plurality of datasets comprises: (i) fetching the data set from the shared memory pool inthe target system, and (ii) processing said data set fetched; and afirst compute element outside the target system, having access to saidfirst database, and configured to convert said code sequence into asequence of executable instructions, in which said sequence ofexecutable instructions, when executed simultaneously by each of aplurality of compute elements of the target system, results in adistributive fetching-and-processing procedure operative, per each ofthe plurality of compute elements, to: send a plurality of data requeststo at least some of the plurality of data interfaces, in which each ofthe data requests is sent to one of the plurality of data interfaces;receive, as a response to each of the data requests, from the datainterface receiving the data request, a reply comprising a specific oneof the data sets stored in the memory module associated with the datainterface; and process said data sets received, such that: said sending,receiving, and processing, by each of the plurality of compute elements,are done asynchronously with any other of the sending, receiving,processing done by any other of the compute elements, until a firstcondition is met.
 2. The system of claim 1, wherein said specific one ofthe data sets is selected by the data interface from the memory modulesuch as to guarantee that said specific one of the data sets has notpreviously been sent in conjunction with previous replies made by thedata interface.
 3. The system of claim 2, wherein said sequence ofexecutable instructions, when executed simultaneously by each of theplurality of data interfaces of the target system, facilitates saidselections, said replies, and therefore said guarantee.
 4. The system ofclaim 2, wherein each of said data interfaces is configured to: receivesome of the plurality of data requests from any one of the plurality ofcompute elements; identify from the data sets of the respective memorymodule the ones that were not served yet, thereby facilitating saidguarantee; serve, as the reply to the data requests, the data setsidentified; and keep track of the ones of the data sets already served,thereby further facilitating said guarantee.
 5. The system of claim 4,wherein said data requests, according to said sequence of executableinstructions, do not specify certain ones of the plurality of data setsto be served, such that said identification and keeping track is theonly way by which said plurality of data interfaces know which one ofsaid plurality of data sets is to be specifically served to the one ofsaid plurality of compute elements making the data request, and suchthat said identification and keeping track is the only way of makingsure, by the target system, that none of the data sets is served morethan once, thereby facilitating said guarantee.
 6. The system of claim4, wherein said sequence of executable instructions, when executedsimultaneously by each of the plurality of data interfaces of the targetsystem, facilitates said identification, said serving, and said keepingtrack.
 7. The system of claim 1, wherein: said first condition is acondition in which the plurality of data sets is served and processed inits entirety by the plurality of compute elements; and said plurality ofcompute elements is configured to execute distributively a first taskassociated with said plurality of data sets by performing saidprocessing of said data sets received, in which said execution of saidfirst task can be done in any order of said processing of said pluralityof data sets, such that any one of said plurality of data sets can beprocessed before or after any other of said plurality of data sets. 8.The system of claim 1, wherein each of the compute elements isconfigured, according to said sequence of executable instructions, pereach said sending of one of said data requests made by such computeelement, to select one of said plurality of data interfaces as a targetof receiving such data request, in which said selection is a round robinselection or a pseudo-random selection.
 9. The system of claim 1,wherein: said code sequence is written in a high-level programminglanguage; and said conversion is a compilation process.
 10. A systemconfigured to generate and execute a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, comprising: a target system comprising: a shared memorypool comprising a plurality of memory modules associated respectivelywith a plurality of data interfaces; and a plurality of computeelements; a first database configured to store a code sequencedescribing an action to be performed by the target system on each of aplurality of data sets stored in the shared memory pool, in which theaction per each of the plurality of data sets comprises: (i) fetchingthe data set from the shared memory pool, and (ii) processing said dataset fetched; and a first compute element outside the target system,having access to said first database, and configured to convert saidcode sequence into a sequence of executable instructions, wherein theplurality of compute elements is configured to execute simultaneouslysaid sequence of executable instructions, resulting in a distributivefetching-and-processing procedure operative, per each of the pluralityof compute elements, to: send a plurality of data requests to at leastsome of the plurality of data interfaces, in which each of the datarequests is sent to one of the plurality of data interfaces; receive, asa response to each of the data requests, from the data interfacereceiving the data request, a reply comprising a specific one of thedata sets stored in the memory module associated with the datainterface; and process said data sets received, such that: said sending,receiving, and processing, by each of the plurality of compute elements,are done asynchronously with any other of the sending, receiving, andprocessing done by any other of the compute elements until a firstcondition is met.
 11. The system of claim 10, wherein: said firstcondition is a condition in which the plurality of data sets is servedand processed in its entirety by the plurality of compute elements; andsaid plurality of compute elements is configured to executedistributively a first task associated with said plurality of data setsby performing said processing of said data sets received, in which saidexecution of said first task can be done in any order of said processingof said plurality of data sets, such that any one of said plurality ofdata sets can be processed before or after any other of said pluralityof data sets.
 12. The system of claim 10, wherein said specific one ofthe data sets is selected by the data interface from the memory module,such as to guarantee that said specific one of the data sets has notpreviously been sent in conjunction with previous replies made by thedata interface.
 13. The system of claim 12, wherein said sequence ofexecutable instructions, when executed simultaneously by each of theplurality of data interfaces, facilitates said selections, said replies,and therefore said guarantee.
 14. The system of claim 10, wherein saidconversion is performed by the first compute element just before theplurality of compute elements starts executing simultaneously saidsequence of executable instructions.
 15. The system of claim 14, whereinsaid first compute element communicates the sequence of executableinstructions to the plurality of compute elements just before theplurality of compute elements starts executing simultaneously saidsequence of executable instructions.
 16. The system of claim 10, whereinsaid first compute element is one of the plurality of compute elements.17. A method for generating automatically a procedure operative todistributively process a plurality of data sets stored on a plurality ofmemory modules, comprising: receiving, by a first compute elementoutside a target system, a code sequence describing an action to beperformed by the target system on each of a plurality of data setsstored in a shared memory pool comprising a plurality of memory modulesassociated respectively with a plurality of data interfaces allbelonging to the target system, in which the action per each of theplurality of data sets comprises: (i) fetching the data set from theshared memory pool in the target system, and (ii) processing said dataset fetched; recognizing, by inspecting the code sequence in the firstcompute element, that (i) the plurality of data sets is stored acrossthe plurality of memory modules associated respectively with theplurality of data interfaces, that (ii) any one of said plurality ofdata sets can be processed before or after any other of said pluralityof data sets, and therefore that (iii) each fetch for one of the datasets can be done by any one of the plurality of compute elements inconjunction with the data interface associated with the memory modulestoring that data set, asynchronously with any other of the fetches doneby any other of the plurality of compute elements in conjunction withany one of the data interfaces; and converting, according to saidrecognition, said code sequence into a sequence of executableinstructions, in which said sequence of executable instructions, whenexecuted simultaneously by each of a plurality of compute elements ofthe target system, results in a distributive fetching-and-processingprocedure operative, per each of the plurality of compute elements, to:send, asynchronously with any other of the plurality of computeelements, a plurality of data requests to at least some of the pluralityof data interfaces, in which each of the data requests is sent to one ofthe plurality of data interfaces; receive, asynchronously with any otherof the plurality of compute elements, as a response to each of the datarequests, from the data interface receiving the data request, a replycomprising a specific one of the data sets stored in the memory moduleassociated with the data interface; and process, asynchronously with anyother of the plurality of compute elements, said data sets received,such that: said sending, receiving, and processing are done, by each ofthe plurality of compute elements, until a first condition is met. 18.The method of claim 17, wherein said recognition is achieved by:identifying, in the code sequence, a loop, in which each iteration ofthe loop describes said action to be performed on one of the pluralityof data sets; and identifying, in the code sequence, that said pluralityof data sets are of a data type intended for storage across saidplurality of memory modules.
 19. The method of claim 18, wherein saidrecognition is further achieved by identifying, in the loop, that saidprocessing of each of the plurality of data sets is unrelated to anyother of the plurality of data sets.
 20. The method of claim 17, whereinsaid recognition is achieved by: identifying, in the code sequence, asingle instruction to be performed on multiple data (SIMD), in whichsaid single instruction is associated with said processing and saidmultiple data are associated with said plurality of data sets; andidentifying, in the code sequence, that said plurality of data sets areof a data type intended for storage across said plurality of memorymodules.